pClock: An arrival curve based approach for QoS guarantees in shared storage systems

Performance Evaluation Review

Volumn 35, Issue 1, 2007, Pages 13-24

  Gulati, Ajay ^a   Merchant, Arif ^b   Varman, Peter J ^a  

^a RICE UNIVERSITY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Burst handling; Fair scheduling; QoS; Real time guarantees; Resource allocation; Storage performance virtualization

Indexed keywords

BURST HANDLING; FAIR SCHEDULING; REAL TIME GUARANTEES; STORAGE PERFORMANCE VIRTUALIZATION;

ALGORITHMS; DATA HANDLING; DATA STORAGE EQUIPMENT; FREQUENCY ALLOCATION; INFORMATION MANAGEMENT; REAL TIME SYSTEMS;

QUALITY OF SERVICE;

EID: 36349018876     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1269899.1254885     Document Type: Conference Paper

References (29)

1. Amazon simple storage service (amazon s3). http://www.amazon.com/gp/ browse.html?node= 16427261.
2. The disksim simulation environment (version 3.0). http://www.pdl.cmu.edu/ DiskSim/.
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. 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 2. IEEE Computer Society, 1999.
6. D. D. Chambliss, G. A. Alvarez, P. Pandey, D. Jadav, J. Xu, R. Menon, and T. P. Lee. Performance virtualization for large-scale storage systems. In Symposium on Reliable Distributed Systems, pages 109-118, Oct 2003.
7. R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6):1048-1056, 1995.
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. 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.
11. P. Qoyal, H. M. Vin, and H. Cheng. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. IEEE/ACM Trans. Netw,5(5):690-704, 1997.
12. A. G. Greenberg and N. Madras. How fair is fair queuing. J. ACM, 39(3):568-598, 1992.
13. L. Huang, G. Peng, and T. cker Chiueh. Multi-dimensional storage virtualization. In SIGMETR/CS '04/Performan.ce '04, pages 14-24, New York, NY, USA, 2004. ACM Press.
14. S. Iyer and R Druschel. Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O. In 18th ACM Symposium on Operating Systems Principles, Oct. 2001.
15. W. Jin, J. S. Chase, and J. Kaur. Interposed proportional sharing for a storage service utility. In SIGMETRICS '04/Performance '04, pages 37-48, New York, NY, USA, 2004. ACM Press.
16. M. Karlsson, C. Karamanolis, and X. Zhu. Triage: Performance differentiation for storage systems using adaptive control. Trans. Storage, 1(4):457-480, 2005.
17. 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.
18. R. McDougall. Filebench: application level file system benchmark. http://www.solarisinternals.com/si/tools/filebench/in.dex.php.
19. T. S. E. Ng, D. C. Stephens, I. Stoica, and H. Zhang. Supporting best-effort traffic with fair service curve. In Measurement and Modeling of Computer Systems, pages 218-219, 1999.
20. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. New., 1(3):344-357, 1993.
21. A. K. Parekh and R. G. Gallagher. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM. Trans. Netw., 2(2):137-150, 1994.
22. A. L. N. Reddy, J. Wyllie, and K. B. R. Wijayaratne. Disk scheduling in a multimedia I/O system. ACM Trans. Multimedia Comput. Commun. Appl., 1(1):37-59, 2005.
23. H. Sariowan, R. L. Cruz, and G. C. Polyzos. Scheduling for quality of service guarantees via service curves. In Proceedings of the International Conference on Computer Communications and Networks, pages 512-520, 1995.
24. P. J. Shenoy and H. M. Vin. Cello: a disk scheduling framework for next generation operating systems. In ACM SIGMETRICS, pages 44-55. ACM Press, 1998.
25. D. Stiliadis and A. Varma. Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE/ACM Transactions on Networking, 6(5):611-624, 1998.
26. I. Stoica, H. Zhang, and T. S. E. Ng. A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services. IEEE/ACM Traits. Netw., 8(2): 185-199, 2000.
27. S. Suri, G. Varghese, and G. Chandramenon. Leap forward virtual clock: A new fair queueing scheme with guaranteed delay and throughput fairness. In INFOCOMM'97, April 1997.
28. J. Zhang, A. Sivasubramaniam, Q. Wang, A. Riska, and E. Riedel. Storage performance virtualization via throughput and latencv control. In MASCOTS, pages 135-142, 2005.
29. L. Zhang. VirtualClock: A new traffic control algorithm for packet-switched networks. ACM Trans. Comput. Syst., 9(2): 101-124.