Abstract
Managed hosting and enterprise wide resource consolidation trends are increasingly leading to sharing of storage resources across multiple classes, corresponding to different applications/customers, each with a different Quality of Service (QoS) requirement. To enable a storage system to meet diverse QoS requirements, we present two algorithms for dynamically allocating cache space among multiple classes of workloads. Our algorithms dynamically adapt the cache space allocated to each class depending upon the observed response time, the temporal locality of reference, and the arrival pattern for each class. Using trace driven simulations collected from large storage system installations, we experimentally demonstrate the following properties of CacheCOW. First, the CacheCOW algorithms enable a storage cache to meet the feasible QoS requirements that class-unaware cache management algorithms such as LRU do not. Second, if an offline, static partitioning of the cache can meet the QoS requirements, our algorithms also meet them and discover the allocations online. Third, the CacheCOW allocations achieve the same feasibility region as that of the offline static algorithms. Finally, the algorithms not only meet the QoS requirements, but also increase the throughput by achieving a higher hit rate whenever feasible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Abdelzaher, K. G. Shin, and N. Bhatti. Performance guarantees for web server end-systems: A control-theoretical approach. IEEE Trans. Parallel and Distributed Systems, 13(1), January 2001.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proc. Usenix Conf. File and Storage Technology (FAST’02), Monterey, CA, pages 175–188, January 2002.
M. Aron, P. Druschel, and S. Iyer. A resource management framework for predictable quality of service in web servers. http://www.cs.rice.edu/~druschel/publications/mbqos_OnlinePDF.pdf, 2001.
E. Borowsky, R. Golding, A. Merchant, L. Schreier, E. Shriver, M. Spasojevic, and J. Wilkes. Using attribute-managed storage to achieve QoS. In Proc. 5th Int. Workshop on Quality of Service (IWQoS), Columbia, NY, pages 75–91, June 1997.
A. Chandra, M. Adler, P. Goyal, and P. Shenoy. Surplus fair scheduling: A proportional-share cpu scheduling algorithm for symmetric multiprocessors. In Proc. Fourth Symp. Operating System Design and Implementation (OSDI 2000), San Diego, CA, October 2000.
B. Forney, A. C. Arpaci-Dusseau, and R. H. Arpaci-Dusseau. Storage-aware caching: Revisiting caching for heterogeneous storage systems. In Proc. USENIX Conf. File and Storage Technologies, 2002.
S. A. Johnson, B. McNutt, and R. Reich. The making of a standard benchmark for open system storage. J. Comp. Resource Management, 101:26–32, 2001.
T. P. Kelly, Y. M. Chan, S. Jamin, and J. K. Mackie-Mason. Biased replacement policies for web caches: Differential quality-of-service and aggregate user value. In Fourth International Web Caching Workshop, San Diego, California, 1999.
Y. Lu, T. Abdelzaher, C. Lu, and G. Tao. An adaptive control framework for QoS guarantees and its application to differentiated caching services. In Proc. Tenth Int. Workshop on Quality of Service, 2002.
R. L. Mattson. Partitioned cache — a new type of cache. In IBM Research Report, 1987.
N. Megiddo and D. S. Modha. ARC: A self-tuning, low overhead replacement cache. In Proc. USENIX Conf. File and Storage Technologies (FAST’03), San Francisco, CA, 2003.
D. Steere, A. Goel, J. Gruenberg, D. McNamee, C. Pu, and J. Walpole. A feedback-driven proportion allocator for real-rate scheduling. In Proc. Symp. Operating Systems Design and Implementation, February 1999.
H. S. Stone, J. Turek, and J. L. Wolf. Optimal partitioning of cache memory. IEEE Tran. Comp., 41(9), September 1992.
V. Sundaram, A. Chandra, P. Goyal, P. Shenoy, J. Sahni, and H. Vin. Application performance in the qlinux multimedia operating system. In Proc. Eighth ACM Conference on Multimedia, Los Angeles, CA, pages 127–136, November 2000.
D. Thiebaut, H. S. Stone, and J. L. Wolf. Improving disk cache hit-ratios through cache partitioning. IEEE Tran. Comp., 41(6), June 1992.
T. Voigt, R. Tewari, D. Freimuth, and A. Mehra. Kernel mechanisms for service differentiation in overloaded web servers. In Proc. Usenix Annual Technical Conference, June 2001.
J. Wilkes. Traveling to Rome: QoS specifications for automated storage system management. In Proc. Int. Workshop on Quality of Service (IWQoS), Karlsruhe, Germany, pages 75–91, June 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goyal, P., Jadav, D., Modha, D.S., Tewari, R. (2003). CacheCOW: QoS for Storage System Caches. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_27
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive