Lexicographic QoS scheduling for parallel I/O

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 29-38

  Gulati, Ajay ^a   Varman, Peter ^a  

^a Rice University   (United States)

Author keywords

Fair Scheduling; Lexicographic minimization; Parallel I O; QoS; Resource allocation; Storage virtualization

Indexed keywords

FAIR SCHEDULING; LEXICOGRAPHIC MINIMIZATION; STORAGE VIRTUALIZATION;

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; SCHEDULING;

QUALITY OF SERVICE;

EID: 32144463500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073975     Document Type: Conference Paper

References (27)

1. S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. J. ACM, 47(6):969-986, 2000.
2. T. E. Anderson, S. S. Owicki, J. B. Saxe, and C. P. Thacker. High speed switch scheduling for local area networks. ACM Transactions On Computer Systems, 11:319-352, November 1993.
3. 2Q: Worst-case fair weighted fair queueing. In INFOCOM(1), pages 120-128, 1996.
4. J. C. R. Bennett and H. Zhang. Hierarchical packet fair queueing algorithms. IEEE/ACM Transactions on Networking, 5(5):675-689, 1997.
5. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. IETF RFC 2475, December 1998.
6. J. Bruno, J. Brustoloni, E. Gabber, B. Ozden, and A. Silberschatz. Disk scheduling with quality of service guarantees. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems Volume II-Volume 2, page 400. IEEE Computer Society, 1999.
7. N. Christin and J. Liebeherr. The QoSbox: A PC-Router for Quantitative Service Differentiation in IP Networks. Technical Report CS-2001-28, University of Virginia, 2001.
8. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queuing algorithm. Journal of Internetworking Research and Experience, 1(1):3-26, September 1990.
9. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In INFOCOMM'94, pages 636-646, April 1994.
10. M. W. Goudreau, S. G. Kolliopoulos, and S. B. Rao. Scheduling algorithms for input-queued switches:randomized techniques and experimental evaluation. IEEE INFOCOM, 3:1634-1643, March 2000.
11. P. Goyal, H. M. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. Technical Report CS-TR-96-02, UT Austin, January 1996.
12. A. G. Greenberg and N. Madras. How fair is fair queuing. J. ACM, 39(3):568-598, 1992.
13. A. Gulati. Scheduling with QoS in parallel I/O systems. Master's thesis, Rice University, Department of Computer Science, June-Nov. 2004.
14. J. L. Hennessy and D. A. Patterson. Computer architecture: a quantitative approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2002.
15. L. Huang, G. Peng, and T. cker Chiueh. Multi-dimensional storage virtualization. SIGMETRICS Perform, Eval. Rev., 32(l):14-24, 2004.
16. D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing with parallel disks. In Proceedings of the 9th Annual European Symposium on Algorithms, pages 62-73. Springer-Verlag, 2001.
17. W. Jin, J. S. Chase, and J. Kaur. Interposed proportional sharing for a storage service utility. SIGMETRICS Perform. Eval. Rev., 32(1):37-48, 2004.
18. M. Kallahalla and P. Varman. Optimal read-once parallel disk scheduling. Proc. 6th ACM Workshop on I/O in Parallel and Distributed Systems (IOPADS'99), pages 68-77, April 1999.
19. M. Kallahalla and P. J. Varman. Optimal prefetching and caching for parallel I/O systems. In 13th ACM Symposium on Parallel Algorithms and Architectures, pages 219-228, July 2001.
20. T. Kimbrel, P. Cao, E. W. Felten, A. R. Karlin, and K. Li. Integrated parallel prefetching and caching. In Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 262-263. ACM Press, 1996.
21. C. Lumb, A. Merchant, and G. Alvarez. Faç ade: Virtual storage devices with performance guarantees. File and Storage technologies (FAST'03), pages 131-144, March 2003.
22. N. McKeown. The iSLIP Scheduling Algorithm for Input-Queued Switches. IEEE/ACM Transactions On Networking, 7:188-201, April 1999.
23. N. Ni and L. N. Bhuyan. Fair scheduling in Internet routers. IEEE Transactions On Computers, pages 686-701, June 2002.
24. S. Sarkar and L. Tassiulas. Fair bandwidth allocation for multicasting in networks with discrete feasible set. IEEE Trans. Comput., 53(7):785-797, 2004.
25. P. J. Shenoy and H. M. Vin. Cello: a disk scheduling framework for next generation operating systems. In Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, pages 44-55. ACM Press, 1998.
26. J. Wilkes. Traveling to rome: Qos specifications for automated storage system management. In International Workshop on QoS, pages 75-91, June 2001.
27. L. Zhang. VirtualClock: A new traffic control algorithm for packe switching networks. In SIGCOMM 90, pages 19-29, September 1990.