Skip to main content

ACAR: An Adaptive Cost Aware Cache Replacement Approach for Flash Memory

  • Conference paper
Web-Age Information Management (WAIM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6184))

Included in the following conference series:

  • 1692 Accesses

Abstract

Flash memory has been gaining more popularity as a substitution for magnetic disk. However, due to asymmetric IO latency, cache management policy needs to be reconsidered in systems equipped with flash. A novel buffer replacement approach named ACAR, which stands for Adaptive Cost Aware cache Replacement, is proposed in this paper to address this problem. Taking operation cost into consideration, ACAR allocates two pools for clean and dirty pages separately. In addition, dynamical pool size tuning is also performed according to IO pattern evolvement. Furthermore, hot data recognition capacity is realized in an enhanced version of ACAR. Experiments with artificial and real IO traces demonstrate ACAR outperforms the state-of-the-art cache replacement strategies.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Jung, H., Shim, H., Park, S., Kang, S., Cha, J.: LRU-WSR: Integration of lru and writes sequence reordering for flash memory. IEEE Transactions on Consumer Electronics 54(3), 1215–1223 (2008)

    Article  Google Scholar 

  3. Jung, H., Yoon, K., Shim, H., Park, S., Kang, S., Cha, J.: LIRS-WSR: Integration of lirs and writes sequence reordering for flash memory. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part I. LNCS, vol. 4705, pp. 224–237. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Google Scholar 

  5. O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Buneman, P., Jajodia, S. (eds.) SIGMOD Conference, pp. 297–306. ACM Press, New York (1993)

    Google Scholar 

  6. 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. Computers 50(12), 1352–1361 (2001)

    Article  MathSciNet  Google Scholar 

  7. Sokolinsky, L.B.: LFU-K: An effective buffer management replacement algorithm. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 670–681. Springer, Heidelberg (2004)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. Jiang, S., Zhang, X.: LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. In: SIGMETRICS, pp. 31–42 (2002)

    Google Scholar 

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

    Google Scholar 

  12. Jo, H., Kang, J.U., Park, S.Y., Kim, J.S., Lee, J.: FAB: Flash-aware buffer management policy for portable media players. IEEE Transactions on Consumer Electronics 52(2), 485–493 (2006)

    Article  Google Scholar 

  13. Kim, H., Ahn, S.: BPLRU: A buffer management scheme for improving random writes in flash storage. In: Baker, M., Riedel, E. (eds.) FAST, pp. 239–252. USENIX (2008)

    Google Scholar 

  14. Bansal, S., Modha, D.S.: CAR: Clock with adaptive replacement. In: FAST, pp. 187–200 (2004)

    Google Scholar 

  15. Park, J., Lee, H., Hyun, S., Koh, K., Bahn, H.: A cost-aware page replacement algorithm for nand flash based mobile embedded systems. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 315–324. Springer, Heidelberg (2003)

    Google Scholar 

  16. Ou, Y., Härder, T., Jin, P.: CFDC: a flash-aware replacement policy for database buffer management. In: DaMoN, pp.15–20 (2009)

    Google Scholar 

  17. Seo, D., Shin, D.: Recently-evicted-first buffer replacement policy for flash storage devices. IEEE Transactions on Consumer Electronics 54(3), 1228–1235 (2008)

    Article  MathSciNet  Google Scholar 

  18. Kgil, T., Mudge, T.N.: Flashcache: a nand flash memory file cache for low power web servers. In: CASES, pp. 103–112 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lv, Y., Chen, X., Cui, B. (2010). ACAR: An Adaptive Cost Aware Cache Replacement Approach for Flash Memory. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds) Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14246-8_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14246-8_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14245-1

  • Online ISBN: 978-3-642-14246-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics