A new proportional-share disk scheduling algorithm: Trading-off I/O throughput and QoS guarantee
SCIE
SCOPUS
- Title
- A new proportional-share disk scheduling algorithm: Trading-off I/O throughput and QoS guarantee
- Authors
- Nam, YJ; Park, C
- Date Issued
- 2003-01
- Publisher
- SPRINGER-VERLAG BERLIN
- Abstract
- Proportional-share algorithms axe 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/18391
- DOI
- 10.1007/3-540-44864-0_27
- ISSN
- 0302-9743
- Article Type
- Article
- Citation
- LECTURE NOTES IN COMPUTER SCIENCE, vol. 2660, page. 257 - 266, 2003-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.