Skip to main content

ABR: An Optimized Buffer Replacement Algorithm for Flash Storage Devices

  • Conference paper
  • First Online:
Social Computing (ICYCSEE 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 623))

Abstract

Flash disks are being widely used as an important alternative to conventional magnetic disks, although accessed through the same interface by applications, their distinguished feature, i.e., different read and write cost makes it necessary to reconsider the design of existing replacement algorithms to leverage their performance potential.

We propose an adaptive cost-aware replacement policy based on average hit distance (AHD) to control the movement of buffer pages when hits occur, thus pages that are re-visited within AHD will stay still. Such a mechanism makes our method adaptive to workloads of different access patterns. The experimental results show that our method not only adaptively tunes itself to workloads of different access patterns, but also works well for different kind of flash disks compared with existing methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lee, S.-W., Moon, B.: Design of flash-based DBMS: an in-page logging approach. In: SIGMOD, pp. 55–66 (2007)

    Google Scholar 

  2. Park, S.-Y., Jung, D., Kang, J.-U., Kim, J., Lee, J.: CFLRU: a replacement algorithm for flash memory. In: CASES, pp. 234–241 (2006)

    Google Scholar 

  3. Jo, H., Kang, J.-U., Park, S.-Y., Kim, J.-S., Lee, J.: FAB: flash-aware buffer management policy for portable media players. IEEE Trans. Consum. Electron. 52(2), 485–493 (2006)

    Article  Google Scholar 

  4. Kim, H., Ahn, S.: BPLRU: a buffer management scheme for improving random writes in flash storage. In: FAST, pp. 239–252 (2008)

    Google Scholar 

  5. Koltsidas, I., Viglas, S.: Flashing up the storage layer. PVLDB 1(1), 514–525 (2008)

    Google Scholar 

  6. Yi, O., Harder, T., Jin, P.: CFDC: a flash-aware replacement policy for database buffer management. In: DaMoN, pp. 15–20 (2009)

    Google Scholar 

  7. Tang, X., Meng, X.: ACR: an adaptive cost-aware buffer replacement algorithm for flash storage devices. In: MDM, pp. 33–42 (2010)

    Google Scholar 

  8. Kim, B.-K., Lee, D.-H.: LSF: a new buffer replacement scheme for flash memory-based portable media players. IEEE Trans. Consum. Electron. 59(1), 130–135 (2013)

    Article  Google Scholar 

  9. Jin, R., Cho, H.-J., Chung, T.-S.: LS-LRU: a lazy-split LRU buffer replacement policy for flash-based B+-tree index. J. Inf. Sci. Eng. 31(3), 1113–1132 (2015)

    Google Scholar 

  10. Jin, P., Yi, O., Härder, T., Li, Z.: AD-LRU: an efficient buffer replacement algorithm for flash-based databases. Data Knowl. Eng. 72, 83–102 (2012)

    Article  Google Scholar 

  11. On, S.T., Gao, S., He, B., Wu, M., Luo, Q., Xu, J.: FD-Buffer: a cost-based adaptive buffer replacement algorithm for flashmemory devices. IEEE Trans. Comput. 63(9), 2288–2301 (2014)

    Article  MathSciNet  Google Scholar 

  12. Johnson, T., Shasha, D.: 2Q: a low overhead high performance buffer management replacement algorithm. In: VLDB, pp. 439–450 (1994)

    Google Scholar 

  13. Megiddo, N., Modha, D.S.: ARC: a self-tuning. low overhead replacement cache. In: FAST (2003)

    Google Scholar 

  14. Jiang, S., Zhang, X.: Making LRU friendly to weak locality workloads: a novel replacement algorithm to improve buffer cache performance. IEEE Trans. Comput. (TC) 54(8), 939–952 (2005)

    Article  Google Scholar 

  15. Babaoglu, O., Joy, W.N.: Converting a swap-based system to do paging in an architecture lacking page-reference bits. In: SOSP, pp. 78–86 (1981)

    Google Scholar 

  16. O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: SIGMOD, pp. 297–306 (1993)

    Google Scholar 

  17. John, T., Robinson, M.V.: Data cache management using frequency-based replacement. In: SIGMETRICS, Devarakonda, pp. 134–142 (1990)

    Google Scholar 

  18. Lee, D., Choi, J., Kim, J.-H., Noh, S.H., Min, S.L., Cho, Y., Kim, C.-S.: LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput. (TC) 50(12), 1352–1361 (2001)

    Article  MathSciNet  Google Scholar 

  19. Jin, P., Su, X., Li, Z.: A flexible simulation environment for flash-aware algorithms. In: CIKM, Lihua Yue, pp. 2093–2094 (2009)

    Google Scholar 

  20. http://www.datasheetcatalog.net

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xian Tang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Tang, X., Li, N., Ma, Q. (2016). ABR: An Optimized Buffer Replacement Algorithm for Flash Storage Devices. In: Che, W., et al. Social Computing. ICYCSEE 2016. Communications in Computer and Information Science, vol 623. Springer, Singapore. https://doi.org/10.1007/978-981-10-2053-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2053-7_14

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2052-0

  • Online ISBN: 978-981-10-2053-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics