Skip to main content

A New Cache Model and Replacement Algorithm for Network Attached Optical Jukebox

  • Conference paper
  • 762 Accesses

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

Abstract

To improve accessing efficiency, increase the accessing rate and enhance system performance for the massive information storage system, we present a logical accessing model and a new replacement algorithm for network attached optical jukebox. We consider not only the whole accessing distribution, but also the logical relation between each accessing in this logical accessing model. And our algorithm combines the specialty of LFU algorithm and MQ algorithm, especially considers the prefetch method to improve the hit rate in cache buffer. The results of simulative experiment show that our algorithm’s performance is much better than other algorithm’s in our accessing model. Furthermore, we can conclude that our accessing model can be also used in processor and web buffer.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. HeNing. Studies on the Applications of Network Attached Jukebox in Mass Storage System. [Ph.D.Dissertation]. Tsinghua University, BeiJing (2004)

    Google Scholar 

  2. O’Neil, E.J., O’Neill, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, vol. 22, pp. 297–306 (1993)

    Google Scholar 

  3. Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proceedings of the 20th VLDB Conference (1994)

    Google Scholar 

  4. Donghee, L., Jongmoo, C., Kim, J.H., et al.: On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. In: Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, vol. 27, pp. 134–143 (1999)

    Google Scholar 

  5. Smaragdakis, Y., Kaplan, S., Wilson, P.: The EELRU adaptive replacement algorithm. Performance Evaluation 53(2), 93–123 (2003)

    Article  Google Scholar 

  6. Jiang, S., Zhang, X.D.: LIRS: An Efficient Low Interreference Recency Set Replacement Policy to Improve Buffer Cache Performance. In: Proc. SIGMETRICS (2002)

    Google Scholar 

  7. Megiddo, N., Modha, D.S.: Arc: A Self-Tuning, Low Overhead Replacement Cache. In: Proceedings of Second USENIX Conference, File and Storage Technologies (2003)

    Google Scholar 

  8. Zhou, Y.Y., Chen, Z.F., Li, K.: Second-Level Buffer Cache Management. IEEE Transactions on Parallel and Distributed Systems 15(6) (June 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Lu, T., Jia, H. (2005). A New Cache Model and Replacement Algorithm for Network Attached Optical Jukebox. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_77

Download citation

  • DOI: https://doi.org/10.1007/11563952_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29227-2

  • Online ISBN: 978-3-540-32087-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics