Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Empirical evaluation of multi-level buffer cache collaboration for storage systems

Published: 06 June 2005 Publication History

Abstract

To bridge the increasing processor-disk performance gap, buffer caches are used in both storage clients (e.g. database systems) and storage servers to reduce the number of slow disk accesses. These buffer caches need to be managed effectively to deliver the performance commensurate to the aggregate buffer cache size. To address this problem, two paradigms have been proposed recently to collaboratively manage these buffer caches together: the hierarchy-aware caching maintains the same I/O interface and is fully transparent to the storage client software, and the aggressively-collaborative caching trades off transparency for performance and requires changes to both the interface and the storage client software. Before storage industry starts to implement collaborative caching in real systems, it is crucial to find out whether sacrificing transparency is really worthwhile, i.e., how much can we gain by using the aggressively-collaborative caching instead of the hierarchy-aware caching? To accurately answer this question, it is required to consider all possible combinations of recently proposed local replacement algorithms and optimization techniques in both collaboration paradigms.Our study provides an empirical evaluation to address the above questions. Particularly, we have compared three aggressively-collaborative approaches with two hierarchy-aware approaches for four different types of database/file I/O workloads using traces collected from real commercial systems such as IBM DB2. More importantly, we separate the effects of collaborative caching from local replacement algorithms and optimizations, and uniformly apply several recently proposed local replacement algorithms and optimizations to all five collaboration approaches.When appropriate local optimizations and replacement algorithms are uniformly applied to both hierarchy-aware and aggressively-collaborative caching, the results indicate that hierarchy-aware caching can deliver similar performance as aggressively-collaborative caching. The results show that the aggressively-collaborative caching only provides less than 2.5% performance improvement on average in simulation and 1.0% in real system experiments over the hierarchy-aware caching for most workloads and cache configurations. Our sensitivity study indicates that the performance gain of aggressively-collaborative caching is also very small for various storage networks and different cache configurations. Therefore, considering its simplicity and generality, hierarchy-aware caching is more feasible than aggressively-collaborative caching.

References

[1]
L. N. Bairavasundaram, M. Sivathanu, A. C. Arpaci-Dusseau, and R. H. Arpaci-Dusseau. X-RAY: A non-invasive exclusive caching mechanism for RAIDs. In Proceedings of the 31th Annual International Symposium on Computer Architecture, pages 176--187, Jun 2004.]]
[2]
L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78--101, 1966.]]
[3]
B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422--426, 1970.]]
[4]
P. Cao and S. Irani. Cost-aware WWW proxy caching algorithms. In Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, pages 193--206, Dec 1997.]]
[5]
M. J. Carey, D. J. DeWitt, M. J. Franklin, N. E. Hall, M. L. McAuliffe, J. F. Naughton, D. T. Schuh, M. H. Solomon, C. K. Tan, O. G. Tsatalos, S. J. White, and M. J. Zwilling. Shoring up persistent applications. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pages 383--394, May 1994.]]
[6]
Z. Chen, Y. Zhou, and K. Li. Eviction-based cache placement for storage caches. In Proceedings of the 2003 USENIX Annual Technical Conference, pages 269--282, Jun 2003.]]
[7]
H.-T. Chou and D. J. DeWitt. An evaluation of buffer management strategies for relational database systems. In Proceedings of the 11th International Conference on Very Large Data Bases, pages 127--141, Aug 1985.]]
[8]
M. D. Dahlin, R. Y. Wang, T. E. Anderson, and D. A. Patterson. Cooperative caching: Using remote client memory to improve file system performance. In Proceedings of the 1st Symposium on Operating Systems Design and Implementation, pages 267--280, Oct 1994.]]
[9]
A. Dan, D. M. Dias, and P. S. Yu. Analytical modelling of a hierarchical buffer for a data sharing environment. In Proceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 156--167, May 1991.]]
[10]
D. Ellard, J. Ledlie, P. Malkani, and M. I. Seltzer. Passive NFS tracing of email and research workloads. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pages 203--216, Mar 2003.]]
[11]
EMC Corporation. Symmetrix 3000 and 5000 Enterprise Storage Systems product description guide. http://www.emc.com/, 1999.]]
[12]
L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. In Proceedings of the 1998 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 254--265, Sep 1998.]]
[13]
M. J. Franklin, M. J. Carey, and M. Livny. Global memory management in client-server database architectures. In Proceedings of the 18th International Conference on Very Large Data Bases, pages 596--609, Aug 1992.]]
[14]
S. Harizopoulos and A. Ailamaki. STEPS towards cache-resident transaction processing. In Proceedings of the 30th International Conference on Very Large Data Bases, pages 660--671, Aug 2004.]]
[15]
IBM. Personal communication with IBM, Sep 2003.]]
[16]
IBM Corporation. The datasheet for IBM TotalStorage DS8000 series. http://www-5.ibm.com/storage/europe/uk/disk/ds8000/, 2004.]]
[17]
InfiniBand Trade Association. Infiniband Architecture Specification, Oct 2000.]]
[18]
S. Jiang and X. Zhang. LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. In Proceedings of the 2002 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 31--42, Jun 2002.]]
[19]
S. Jiang and X. Zhang. ULC: A file block placement and replacement protocol to effectively exploit hierarchical locality in multi-level buffer caches. In Proceedings of the 24th International Conference on Distributed Computing Systems, Mar 2004.]]
[20]
T. Johnson and D. Shasha. 2Q: A low overhead high performance buffer management replacement algorithm. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 439--450, Sep 1994.]]
[21]
D. Karger, A. Sherman, A. Berkheimer, B. Bogstad, R. Dhanidina, K. Iwamoto, B. Kim, L. Matkins, and Y. Yerushalmi. Web caching with consistent hashing. In Proceeding of the 8th International Conference on World Wide Web, pages 1203--1213, May 1999.]]
[22]
T. Leighton. The challenges of delivering content on the Internet. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, page 246, May 2001.]]
[23]
C. R. Lumb, J. Schindler, and G. R. Ganger. Freeblock scheduling outside of disk firmware. In Proceedings of the 2002 USENIX Annual Technical Conference, pages 213--226, Jan 2002.]]
[24]
N. Megiddo and D. S. Modha. ARC: A self-tuning, low overhead replacement cache. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pages 115--130, Mar 2003.]]
[25]
D. Muntz and P. Honeyman. Multi-level caching in distributed file systems -or- your cache ain't nuthin' but trash. In Proceedings of the Winter 1992 USENIX Conference, pages 305--314, Jan 1992.]]
[26]
V. F. Nicola, A. Dan, and D. M. Dias. Analysis of the generalized clock buffer replacement scheme for database transaction processing. In Proceedings of the 1992 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pages 35--46, Jun 1992.]]
[27]
R. H. Patterson, G. A. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. In Proceedings of the 15th ACM Symposium on Operating Systems Principles, pages 79--95, Dec 1995.]]
[28]
J. T. Robinson and M. V. Devarakonda. Data cache management using frequency-based replacement. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 134--142, May 1990.]]
[29]
P. Sarkar and J. Hartman. Efficient cooperative caching using hints. In Proceedings of the 2nd USENIX symposium on Operating Systems Design and Implementation, pages 35--46, Oct 1996.]]
[30]
Y. Smaragdakis, S. Kaplan, and P. Wilson. EELRU: simple and effective adaptive page replacement. In Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer systems, pages 122--133, May 1999.]]
[31]
M. Stonebraker. Operating system support for database management. Communications of the ACM, 24(7):412--418, 1981.]]
[32]
Transaction processing performance council. http://www.tpc.org.]]
[33]
D. L. Willick, D. L. Eager, and R. B. Bunt. Disk cache replacement policies for network fileservers. In Proceedings of the 13th International Conference on Distributed Computing Systems, pages 2--11, May 1993.]]
[34]
T. Wong and J. Wilkes. My cache or yours? Making storage more exclusive. In Proceedings of the 2002 USENIX Annual Technical Conference, pages 161--175, Jun 2002.]]
[35]
P. Zhou, V. Pandey, J. Sundaresan, A. Raghuraman, Y. Zhou, and S. Kumar. Dynamic tracking of page miss ratio curve for memory management. In Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 177--188, Oct 2004.]]
[36]
Y. Zhou, A. Bilas, S. Jagannathan, C. Dubnicki, J. F. Philbin, and K. Li. Experiences with VI communication for database storage. In Proceedings of the 29th Annual International Symposium on Computer Architecture, pages 257--268, May 2002.]]
[37]
Y. Zhou, J. Philbin, and K. Li. The multi-queue replacement algorithm for second level buffer caches. In Proceedings of the 2001 USENIX Annual Technical Conference, pages 91--104, Jun 2001.]]

Cited By

View all
  • (2021)MDupl: A Replica Strategy of Cloud Storage systemProcedia Computer Science10.1016/j.procs.2021.05.047188(4-17)Online publication date: 2021
  • (2018)Efficient cache resource aggregation using adaptive multi-level exclusive caching policiesFuture Generation Computer Systems10.1016/j.future.2017.09.04486(964-974)Online publication date: Sep-2018
  • (2015)A Regional Popularity-Aware Cache replacement algorithm to improve the performance and lifetime of SSD-based disk cache2015 IEEE International Conference on Networking, Architecture and Storage (NAS)10.1109/NAS.2015.7255203(45-53)Online publication date: Aug-2015
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 33, Issue 1
Performance evaluation review
June 2005
417 pages
ISSN:0163-5999
DOI:10.1145/1071690
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
    June 2005
    428 pages
    ISBN:1595930221
    DOI:10.1145/1064212
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2005
Published in SIGMETRICS Volume 33, Issue 1

Check for updates

Author Tags

  1. collaborative caching
  2. database
  3. file system
  4. storage system

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)16
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)MDupl: A Replica Strategy of Cloud Storage systemProcedia Computer Science10.1016/j.procs.2021.05.047188(4-17)Online publication date: 2021
  • (2018)Efficient cache resource aggregation using adaptive multi-level exclusive caching policiesFuture Generation Computer Systems10.1016/j.future.2017.09.04486(964-974)Online publication date: Sep-2018
  • (2015)A Regional Popularity-Aware Cache replacement algorithm to improve the performance and lifetime of SSD-based disk cache2015 IEEE International Conference on Networking, Architecture and Storage (NAS)10.1109/NAS.2015.7255203(45-53)Online publication date: Aug-2015
  • (2015)The Case for Workflow-Aware StorageJournal of Grid Computing10.1007/s10723-014-9307-613:1(95-113)Online publication date: 1-Mar-2015
  • (2015)AMC: an adaptive multi‐level cache algorithm in hybrid storage systemsConcurrency and Computation: Practice and Experience10.1002/cpe.353027:16(4230-4246)Online publication date: 28-May-2015
  • (2013)Cache, cache everywhere, flushing all hits down the sink: On exclusivity in multilevel, hybrid caches2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST)10.1109/MSST.2013.6558445(1-14)Online publication date: May-2013
  • (2012)An update-aware storage system for low-locality update-intensive workloadsACM SIGPLAN Notices10.1145/2248487.215101647:4(375-386)Online publication date: 3-Mar-2012
  • (2012)An update-aware storage system for low-locality update-intensive workloadsACM SIGARCH Computer Architecture News10.1145/2189750.215101640:1(375-386)Online publication date: 3-Mar-2012
  • (2012)An update-aware storage system for low-locality update-intensive workloadsProceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems10.1145/2150976.2151016(375-386)Online publication date: 3-Mar-2012
  • (2011)Dawning Nebulae: A PetaFLOPS Supercomputer with a Heterogeneous StructureJournal of Computer Science and Technology10.1007/s11390-011-1138-326:3(352-362)Online publication date: 12-May-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media