[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1866480.1866482acmconferencesArticle/Chapter ViewAbstractPublication PagesideasConference Proceedingsconference-collections
research-article

Clean first or dirty first?: a cost-aware self-adaptive buffer replacement policy

Published: 16 August 2010 Publication History

Abstract

Flash SSDs originate a disruptive change concerning storage technology and become a competitor for conventional magnetic disks in the area of persistent database stores. Compared to them, they provide a dramatic speed-up for random reads, but exhibit a distinct read/write (R/W) asymmetry, i.e., updates are more expensive than reads. Existing buffer management algorithms for those devices usually trade physical reads for physical writes to some extent. But they ignore the actual R/W cost ratio of the underlying device and the update intensity of the workload. Therefore, their performance advantage is sensitive to device and workload changes. We propose CASA (Cost-Aware Self-Adaptive), a novel buffer replacement policy, which makes the trade-off between physical reads and physical writes in a controlled fashion, depending on the R/W cost ratio, and automatically adapts itself to changing update intensities in workloads. Our experiments show that CASA outperforms previous proposals in a variety of cost settings and under changing workloads.

References

[1]
}}W. Effelsberg and T. Härder. Principles of database buffer management. ACM TODS, 9(4):560--595, 12 1984.
[2]
}}Intel Corp. X25-V SATA SSD Datasheet. http://download.intel.com/design/flash/nand/value/datashts/322736.pdf, 2010.
[3]
}}Intel Corp. X25-M SATA SSD Datasheet. http://download.intel.com/design/flash/nand/mainstream/322296.pdf, 2010.
[4]
}}S. Park, D. Jung, et al. CFLRU: a replacement algorithm for flash memory. In CASES, pages 234--241, 2006.
[5]
}}Y. Ou, T. Härder, et al. CFDC: a flash-aware replacement policy for database buffer management. In SIGMOD Workshop DaMoN (Data Management on New Hardware), pages 15--20, Providence, RI, 2009. ACM.
[6]
}}H. Jung, H. Shim, et al. LRU-WSR: integration of LRU and writes sequence reordering for flash memory. Trans. on Cons. Electr., 54(3):1215--1223, 2008.
[7]
}}A. S. Tanenbaum. Operating Systems, Design and Impl. Prentice-Hall, 1987.
[8]
}}Z. Li, P. Jin, et al. CCF-LRU: A new buffer replacement algorithm for flash memory. Trans. on Cons. Electr., 55:1351--1359, 2009.
[9]
}}Y. S. Yoo, H. Lee, et al. Page replacement algorithms for nand flash memory storages. In Computational Science and Its Applications (ICCSA 07), pages 201--212. Springer, 2007.
[10]
}}J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
[11]
}}T. Härder and A. Reuter. Principles of transaction-oriented database recovery. ACM Computing Surveys, 15(4):287--317, 12 1983.
[12]
}}C. Mohan, D. J. Haderle, et al. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans. Database Syst., 17(1):94--162, 1992.
[13]
}}E. J. O'Neil, P. E. O'Neil, et al. The LRU-K page replacement algorithm for database disk buffering. In SIGMOD, pages 297--306, 1993.
[14]
}}T. Johnson, D. Shasha, et al. 2Q: a low overhead high performance bu er management replacement algorithm. In VLDB, pages 439--450, 1994.
[15]
}}D. Lee, J. Choi, et al. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies. Trans. on Computers, 50(12):1352--1361, 2001.
[16]
}}N. Megiddo and D. S. Modha. ARC: A self-tuning, low overhead replacement cache. In FAST. USENIX, 2003.
[17]
}}L. Bouganim, B. T. Jónsson, et al. uFLIP: Understanding flash IO patterns. In CIDR, 2009.

Cited By

View all
  • (2018)Efficient Buffer Management for Tree Indexes on Solid State DrivesInternational Journal of Parallel Programming10.1007/s10766-014-0340-744:1(5-25)Online publication date: 28-Dec-2018
  • (2015)Operating system level data tiering using online workload characterizationThe Journal of Supercomputing10.1007/s11227-015-1377-071:4(1534-1562)Online publication date: 1-Apr-2015
  • (2015)A Cost-aware Buffer Management Policy for Flash-based Storage DevicesDatabase Systems for Advanced Applications10.1007/978-3-319-18120-2_11(175-190)Online publication date: 9-Apr-2015
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
IDEAS '10: Proceedings of the Fourteenth International Database Engineering & Applications Symposium
August 2010
282 pages
ISBN:9781605589008
DOI:10.1145/1866480
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 August 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cache
  2. database storage
  3. flash SSD
  4. replacement policy

Qualifiers

  • Research-article

Conference

IDEAS '10
Sponsor:
  • ACM
  • Concordia University

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)1
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2018)Efficient Buffer Management for Tree Indexes on Solid State DrivesInternational Journal of Parallel Programming10.1007/s10766-014-0340-744:1(5-25)Online publication date: 28-Dec-2018
  • (2015)Operating system level data tiering using online workload characterizationThe Journal of Supercomputing10.1007/s11227-015-1377-071:4(1534-1562)Online publication date: 1-Apr-2015
  • (2015)A Cost-aware Buffer Management Policy for Flash-based Storage DevicesDatabase Systems for Advanced Applications10.1007/978-3-319-18120-2_11(175-190)Online publication date: 9-Apr-2015
  • (2014)Wear-Aware Algorithms for PCM-Based Database Buffer PoolsWeb-Age Information Management10.1007/978-3-319-11538-2_16(165-176)Online publication date: 10-Oct-2014
  • (2014)TL: A High Performance Buffer Replacement Strategy for Read-Write Splitting Web ApplicationsWeb Technologies and Applications10.1007/978-3-319-11116-2_42(478-484)Online publication date: 2014
  • (2013)Flash-Aware Buffer Management for Database SystemsInternational Journal of Knowledge-Based Organizations10.4018/ijkbo.20131001023:4(22-39)Online publication date: Oct-2013
  • (2011)Operation-aware buffer management in flash-based systemsProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989326(13-24)Online publication date: 12-Jun-2011
  • (2011)Trading Memory for Performance and EnergyDatabase Systems for Adanced Applications10.1007/978-3-642-20244-5_24(241-253)Online publication date: 2011

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