A new proportional-share disk scheduling algorithm: trading-off I/O throughput and qos guarantee

Authors:
Young Jin Nam;Chanik Park
Affiliations:
Department of Computer Science and Engineering, Pohang University of Science and Technology, PIRL, Kyungbuk, Republic of Korea;Department of Computer Science and Engineering, Pohang University of Science and Technology, PIRL, Kyungbuk, Republic of Korea
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science
Year:
2003

Citing 4
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Cello: a disk scheduling framework for next generation operating systems

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Disk Scheduling with Quality of Service Guarantees

ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02

Storage qos control with adaptive i/o deadline assignment and slack-stealing EDF

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proportional-share algorithms are designed to allocate an available resource, such as a network, processor, or disk, for a set of competing applications in proportion to the resource weight allotted to each. While a myriad of proportional-share algorithms were made for network and processor resources, little research work has been conducted on disk resources which exhibit non-linear performance characteristics attributed to disk head movements. This paper proposes a new proportional-share disk scheduling algorithm which accounts for overhead caused by disk head movements and QoS guarantees in an integrated manner. Performance evaluations via simulations reveal that the proposed algorithm improves I/O throughput by 11-19% with only 1-2% QoS deterioration.