A new cache model and replacement algorithm for network attached optical jukebox

Authors:
Xuan Liu;Tijun Lu;Huibo Jia
Affiliations:
Optical Memory National Engineer Research Center, Tsinghua Unversity, Beijing, China;Optical Memory National Engineer Research Center, Tsinghua Unversity, Beijing, China;Optical Memory National Engineer Research Center, Tsinghua Unversity, Beijing, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 7
Cited 0

The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The EELRU adaptive replacement algorithm

Performance Evaluation
Second-Level Buffer Cache Management

IEEE Transactions on Parallel and Distributed Systems
ARC: a self-tuning, low overhead replacement cache

FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies

Quantified Score

Hi-index	0.00

Visualization

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.