ABSTRACT
Storage consolidation is becoming an attractive paradigm for data organization because of the economies of sharing and the ease of centralized management. However, sharing of resources is viable only if applications can be isolated from each other. This work targets the problem of providing performance guarantees to an application irrespective of the behavior of other workloads. Application requirements are represented in terms of the average throughput, latency and maximum burst size. Most earlier schemes only do weighted bandwidth allocation; schemes that provide control of latency either cannot handle bursts or penalize applications for their own prior behavior, such as using spare capacity.
Our algorithm pClock is based on arrival curves that intuitively capture the bandwidth and burst requirements of applications. We show analytically that an application following its arrival curve never misses its deadline. We have implemented pClock both in DiskSim and as a module in the Linux kernel 2.6. Our evaluation shows three important features of pClock: (1) benefits over existing algorithms; (2) efficient performance isolation and burst handling; and (3) the ability to allocate spare capacity to either speed up some applications or to a background utility, such as backup. pClock can be efficiently implemented in a system without much overhead.
- Amazon simple storage service (amazon s3). http://www.amazon.com/gp/browse.html?node=16427261.Google Scholar
- The disksim simulation environment (version 3.0). http://www.pdl.cmu.edu/DiskSim/.Google Scholar
- J. C. R. Bennett and H. Zhang.WF2Q: Worst-case fair weighted fair queueing. In INFOCOM (1), pages 120--128, 1996. Google ScholarDigital Library
- J. C. R. Bennett and H. Zhang. Hierarchical packet fair queueing algorithms. IEEE/ACM Transactions on Networking, 5(5):675--689, 1997. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6):1048--1056, 1995. Google ScholarDigital Library
- 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.Google Scholar
- S. Golestani. A self-clocked fair queueing scheme for broadband applications. In INFOCOMM'94, pages 636--646, April 1994.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- P. Goyal, 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. Google ScholarDigital Library
- A. G. Greenberg and N. Madras. How fair is fair queuing. J. ACM, 39(3):568--598, 1992. Google ScholarDigital Library
- L. Huang, G. Peng, and T. cker Chiueh. Multi-dimensional storage virtualization. In SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 14--24, New York, NY, USA, 2004. ACM Press. Google ScholarDigital Library
- S. Iyer and P. 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. Google ScholarDigital Library
- W. Jin, J. S. Chase, and J. Kaur. Interposed proportional sharing for a storage service utility. In SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 37--48, New York, NY, USA, 2004. ACM Press. Google ScholarDigital Library
- M. Karlsson, C. Karamanolis, and X. Zhu. Triage: Performance differentiation for storage systems using adaptive control. Trans. Storage, 1(4):457--480, 2005. Google ScholarDigital Library
- C. Lumb, A. Merchant, and G. Alvarez. Facçade: Virtual storage devices with performance guarantees. File and Storage technologies (FAST'03), pages 131--144, March 2003. Google ScholarDigital Library
- R. McDougall. Filebench:application level file system benchmark. http://www.solarisinternals.com/si/tools/filebench/index.php.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Zhang, A. Sivasubramaniam, Q. Wang, A. Riska, and E. Riedel. Storage performance virtualization via throughput and latency control. In MASCOTS, pages 135--142, 2005. Google ScholarDigital Library
- L. Zhang. VirtualClock: A new traffic control algorithm for packet-switched networks. ACM Trans. Comput. Syst., 9(2):101--124. Google ScholarDigital Library
Index Terms
- pClock: an arrival curve based approach for QoS guarantees in shared storage systems
Recommendations
pClock: an arrival curve based approach for QoS guarantees in shared storage systems
SIGMETRICS '07 Conference ProceedingsStorage consolidation is becoming an attractive paradigm for data organization because of the economies of sharing and the ease of centralized management. However, sharing of resources is viable only if applications can be isolated from each other. This ...
A flexible approach to efficient resource sharing in virtualized environments
CF '11: Proceedings of the 8th ACM International Conference on Computing FrontiersCloud-based storage and computing are growing in popularity due to economies of using a centralized infrastructure that can be leased at low cost. The increased use of virtual-machine-based server consolidation in such data centers introduces new ...
Maximizing VMs' IO Performance on Overcommitted CPUs with Fairness
SoCC '23: Proceedings of the 2023 ACM Symposium on Cloud ComputingTo improve resource utilization and reduce costs many Cloud providers adopt virtual machines (VMs) overcommitment. While effective, this strategy may lead to adverse outcomes, significantly affecting a VM IO performance when one virtual CPU (vCPU) is ...
Comments