Mclock: Handling throughput variability for hypervisor IO scheduling

Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010

Volumn , Issue , 2019, Pages 437-450

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

^a VMWARE INC   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL RESOURCES MANAGEMENT; SYSTEMS ANALYSIS;

COMMODITY OPERATING SYSTEMS; DEVELOPMENT ENVIRONMENT; DISTRIBUTED STORAGE; INTERACTIVE DESKTOPS; PROPORTIONAL-SHARE; PROTOTYPE IMPLEMENTATIONS; RESOURCE MANAGEMENT; THROUGHPUT VARIABILITIES;

RESOURCE ALLOCATION;

EID: 85076921619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (50)

1. Personal communications with many customers.
2. Dell Inc. DVDStore benchmark. http://delltechcenter.com/page/DVD+store.
3. Distributed Resource Scheduler, VMware Inc. http://www.vmware.com/products/vi/vc/drs.html.
4. HP Lefthand SAN appliance. http://www.lefthandsan.com/.
5. Iometer. http://www.iometer.org.
6. Seanodes Inc. http://www.seanodes.com/.
7. VMware ESX Server User Manual, December 2007. VMware Inc.
8. vSphere Resource Management Guide, December 2009. VMware Inc.
9. M. Abd-El-Malek et al. Ursa Minor: Versatile cluster-based storage. In USENIX FAST, 2005.
10. 2Q: Worst-case fair weighted fair queueing. In INFOCOM, pages 120-128, 1996.
11. A. T. Clements, I. Ahmad, M. Vilayannur, J. Li, and V. Inc. Decentralized deduplication in SAN cluster file systems. In USENIX Annual Technical Conference, 2009.
12. R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6):1048-1056, 1995.
13. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queuing algorithm. Journal of Internet-working Research and Experience, 1(1):3-26, September 1990.
14. K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. SOSP:ACM Symposium on Operating Systems Principles, 1999.
15. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In INFOCOMM'94, pages 636-646, April 1994.
16. K. Govil, D. Teodosiu, Y. Huang, and M. Rosenblum. Cellular disco: resource management using virtual clusters on shared-memory multiprocessors. In SOSP:ACM Symposium on Operating Systems Principles, 1999.
17. P. Goyal, X. Guo, and H. M. Vin. A hierarchial CPU scheduler for multimedia operating systems. SIGOPS Oper. Syst. Rev., 30(SI):107-121, 1996.
18. 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.
19. A. Gulati. Performance virtualization and QoS in Shared storage systems. PhD thesis, Rice University, Houston, TX, USA, 2008.
20. A. Gulati, I. Ahmad, and C. Waldspurger. PARDA: Proportional Allocation of Resources in Distributed Storage Access. In (FAST'09)Proceedings of the Seventh Usenix Conference on File and Storage Technologies, Feb 2009.
21. A. Gulati, A. Merchant, and P. Varman. d-clock: Distributed QoS in heterogeneous resource environments. In PODC'07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pages 330-331, New York, NY, USA, 2007. ACM.
22. A. Gulati, A. Merchant, and P. Varman. pClock: An arrival curve based approach for QoS in shared storage systems. In ACM SIGMETRICS, 2007.
23. L. Huang, G. Peng, and T. cker Chiueh. Multidimensional storage virtualization. In ACM SIGMETRICS, pages 14-24, 2004.
24. W. Jin, J. S. Chase, and J. Kaur. Interposed proportional sharing for a storage service utility. In ACM SIGMETRICS, 2004.
25. M. B. Jones, D. Rosu, and M.-C. Rosu. CPU reservations and time constraints: Efficient, predictable scheduling of independent activities. In SOSP:ACM Symposium on Operating Systems Principles, 1997.
26. R. McDougall. Filebench: Application level file system benchmark. http://www.solarisinternals.com/si/tools/filebench/index.php.
27. 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.
28. J. Nieh and M. S. Lam. A smart scheduler for multimedia applications. ACM Trans. Comput. Syst., 21(2):117-163, 2003.
29. 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. Netw., 1(3):344-357, 1993.
30. Y. Saito et al. FAB: building distributed enterprise disk arrays from commodity components. SIGPLAN Not., 39(11):48-58, 2004.
31. 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.
32. R. Stanojevic and R. Shorten. Fully decentralized emulation of best-effort and processor sharing queues. In ACM SIGMETRICS, 2008.
33. 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.
34. I. Stoica, H. Abdel-wahab, and K. Jeffay. On the duality between resource reservation and proportional share resource allocation. In Proc. of Multimedia Computing and Networking, pages 207-214, 1997.
35. I. Stoica, H. Abdel-wahab, K. Jeffay, S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. A proportional share resource allocation algorithm for real-time, time-shared systems. In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 288-299, 1996.
36. 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 Trans. Netw., 8(2):185-199, 2000.
37. D. G. Sullivan and M. I. Seltzer. Isolation with Flexibility: A resource management framework for central servers. In USENIX Annual Technical Conference, 2000.
38. 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.
39. B. Verghese, A. Gupta, and M. Rosenblum. Performance isolation: sharing and isolation in shared-memory multiprocessors. In ASPLOS-VIII, pages 181-192, New York, NY, USA, 1998. ACM.
40. VMware, Inc. Introduction to VMware Infrastructure. 2007. http://www.vmware.com/support/pubs/.
41. M. Wachs, M. Abd-El-Malek, E. Thereska, and G. R. Ganger. Argon: performance insulation for shared storage servers. In USENIX FAST, Berkeley, CA, USA, 2007.
42. C. Waldspurger. Personal Communications.
43. C. A. Waldspurger. Lottery and stride scheduling: flexible proportional-share resource management. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 1995.
44. C. A. Waldspurger. Memory resource management in VMware ESX server. In (OSDI'02): Proceedings of the Fifth symposium on Operating systems Design and Implementation, 2002.
45. Y. Wang and A. Merchant. Proportional-share scheduling for distributed storage systems. In Usenix FAST, February 2007.
46. W. Wilcke et al. IBM intelligent bricks project - petabytes and beyond. IBM Journal of Research and Development, 50, 2006.
47. J. C. Wu, S. Banachowski, and S. A. Brandt. Hierarchical disk sharing for multimedia systems. In NOSSDAV. ACM, 2005.
48. J. C. Wu and S. A. Brandt. The design and implementation of Aqua: an adaptive quality of service aware object-based storage device. In Proc. of IEEE/NASA MSST, pages 209-218, May 2006.
49. J. Zhang, A. Sivasubramaniam, Q. Wang, A. Riska, and E. Riedel. Storage performance virtualization via throughput and latency control. In IEEE MASCOTS, pages 135-142, 2005.
50. L. Zhang. VirtualClock: A new traffic control algorithm for packet-switched networks. ACM Trans. Comput. Syst., 9(2):101-124.