Design and evaluation of an efficient proportional-share disk scheduling algorithm

Authors:
Young Jin Nam;Chanik Park
Affiliations:
School of Computer and Information Technology, Duegu University, Jinryang, Gyeongsan, Kyungbuk, South Korea;Division of Electrical and Computer Engineering, Pohang University of Science and Technology (POSTECH), Pohang, South Korea
Venue:
Future Generation Computer Systems - Parallel input/output management techniques (PIOMT) in cluster and grid computing
Year:
2006

Citing 7
Cited 3

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

IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for modern disk drives

SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
Freeblock Scheduling Outside of Disk Firmware

FAST '02 Proceedings of the Conference on File and Storage Technologies
Disk Scheduling with Quality of Service Guarantees

ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Façade: Virtual Storage Devices with Performance Guarantees

FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies

Using economic regulation to prevent resource congestion in large-scale shared infrastructures

Future Generation Computer Systems
Moneta: A High-Performance Storage Array Architecture for Next-Generation, Non-volatile Memories

MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
A Stackelberg game to derive the limits of energy savings for the allocation of data center resources

Future Generation Computer Systems

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.