Fairness and performance isolation: An analysis of disk scheduling algorithms

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2006, Pages

  Seelam, Seetharami R ^a   Teller, Patricia J ^a  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(PL) PROPERTIES; APPLICATION PERFORMANCE; CLUSTER COMPUTING; DISK SCHEDULING ALGORITHMS; EXPERIMENTAL EVALUATIONS; FAIRNESS PROPERTIES; FORMAL ANALYSIS; I/O SYSTEMS; INTERNATIONAL CONFERENCES; QUALITY-OF-SERVICE GUARANTEES;

DISKS (STRUCTURAL COMPONENTS); MODAL ANALYSIS; MULTITASKING; QUALITY OF SERVICE; SCHEDULING; TELECOMMUNICATION NETWORKS;

SCHEDULING ALGORITHMS;

EID: 46049093784     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2006.311899     Document Type: Conference Paper

References (15)

1. G. Alvarez, E. Borowsky, T. R. S. Go, R. Becker-Szendy, R. Golding, A. Merchant, M. Spasojevic, A. Veitch, and J. Wilkes. Minerva: an automated resource provisioning tool for large-scale storage systems. ACM Transactions on Computer Systems, 19(4):483-518, November 2001.
2. E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administrators. Conference on File and Storage Technologies (FAST), pages 175-188, January 2002.
3. J. Axboe. Time sliced CFQ I/O scheduler. http://kerneltrap.org/node/4406.
4. J. Axboe. Linux block IO - present and future. In Proceedings of the Ottawa Linux Symposium 2004, pages 51-61, July 2004.
5. J. Bruno, J. Brustoloni, E. Gabber, B. Ozden, and A. Silber-schatz. Disk scheduling with quality of service guarantees. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems, pages 400-405, June 1999.
6. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proceedings of the SIGCOMM Symposium on Communications Architectures and Protocols, pages 1-12, Austin, TX, September 1989.
7. S. J. Golestani. A self-clocked fair queueing scheme for broadband applications. In Proceedings of IEEE INFOCOM'94, pages 636-646, Toronto, Canada, June 1994.
8. P. Goyal, H. M. Vin, and H. Chen. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. ACM SIGCOMM Computer Communication Review, 26(4): 157-168, October 1996.
9. A. G. Greenberg and N. Madras. How fair is fair queuing. Journal of the ACM, 39(3):568-598, July 1992.
10. P. McKenney. Stochastic fairness queueing. In Internet-working: Research and Experience, volume 2, pages 113-131, January 1991.
11. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. In IEEE/ACM Trans. Networking, volume 1, pages 344-357, June 1993.
12. P. Shenoy and H. Vin. Cello: a disk scheduling framework for next generation operating systems. Real-Time Systems, 22(1-2):9-48, January 2002.
13. M. Shreedhar and G. Varghese. Efficient fair queueing using deficit round-robin. IEEE/ACM Transactions on Networking (TON), 4(3):375-385, June 1996.
14. G. Tan and J. Guttag. Time-based fairness improves performance in multi-rate WLANs. In Proceedings of the USENIX Annual Technical Conference, Boston, MA, June 2004.
15. B. Verghese, A. Gupta, and M. Rosenblum. Performance isolation: sharing and isolation in shared-memory multiprocessors. In 8th International Conference on Architectural Support for Programming Languages and Operating Systems, 1998.