| Data cache management using frequency-based replacement |
| Full text |
Pdf
(991 KB)
|
| Source
|
Joint International Conference on Measurement and Modeling of Computer Systems
archive
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
table of contents
Univ. of Colorado, Boulder, Colorado, United States
Pages: 134 - 142
Year of Publication: 1990
ISBN:0-89791-359-0
Also published in ...
|
|
Authors
|
|
John T. Robinson
|
IBM Research Division, T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY
|
|
Murthy V. Devarakonda
|
IBM Research Division, T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 15, Downloads (12 Months): 145, Citation Count: 71
|
|
|
ABSTRACT
We propose a new frequency-based replacement algorithm for managing caches used for disk blocks by a file system, database management system, or disk control unit, which we refer to here as data caches. Previously, LRU replacement has usually been used for such caches. We describe a replacement algorithm based on the concept of maintaining reference counts in which locality has been “factored out”. In this algorithm replacement choices are made using a combination of reference frequency and block age. Simulation results based on traces of file system and I/O activity from actual systems show that this algorithm can offer up to 34% performance improvement over LRU replacement, where the improvement is expressed as the fraction of the performance gain achieved between LRU replacement and the theoretically optimal policy in which the reference string must be known in advance. Furthermore, the implementation complexity and efficiency of this algorithm is comparable to one using LRU replacement.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
BOZM89
|
|
| |
COFF73
|
|
| |
DEVA88
|
|
| |
DEVA90
|
Devarakonda, M. Analysis of file cache replacement algorithms using UNIX traces, Res. report RC15410, IBM Research Div., T. J. Watson Res. Ctr., Yorktown Hts., NY, 1990.
|
 |
EFFE84
|
|
 |
OUST85
|
John K. Ousterhout , Hervé Da Costa , David Harrison , John A. Kunze , Mike Kupfer , James G. Thompson, A trace-driven analysis of the UNIX 4.2 BSD file system, Proceedings of the tenth ACM symposium on Operating systems principles, p.15-24, December 1985, Orcas Island, Washington, United States
|
 |
SMIT82
|
|
 |
SMIT85
|
|
CITED BY 71
|
|
Jong Min Kim , Jongmoo Choi , Jesung Kim , Sam H. Noh , Sang Lyul Min , Yookun Cho , Chong Sang Kim, A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references, Proceedings of the 4th conference on Symposium on Operating System Design & Implementation, p.9-9, October 22-25, 2000, San Diego, California
|
|
|
|
Donghee Lee , Jongmoo Choi , Jong-Hun Kim , Sam H. Noh , Sang Lyul Min , Yookun Cho , Chong Sang Kim, On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies, ACM SIGMETRICS Performance Evaluation Review, v.27 n.1, p.134-143, June 1999
|
|
|
Jongmoo Choi , Sam H. Noh , Sang Lyul Min , Eun-Yong Ha , Yookun Cho, Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme, IEEE Transactions on Computers, v.51 n.7, p.793-800, July 2002
|
|
|
|
|
Jongmoo Choi , Sam H. Noh , Sang Lyul Min , Yookun Cho, An implementation study of a detection-based adaptive block replacement scheme, Proceedings of the Annual Technical Conference on 1999 USENIX Annual Technical Conference, p.18-18, June 06-11, 1999, Monterey, California
|
|
|
|
|
|
|
|
|
|
|
|
Anthony K. H. Tung , Y. C. Tay , Hongjun Lu, BROOM: buffer replacement using online optimization by mining, Proceedings of the seventh international conference on Information and knowledge management, p.185-192, November 02-07, 1998, Bethesda, Maryland, United States
|
|
|
|
|
|
|
|
D. Lee , J. Choi , J. H. Kim , S. H. Noh , S. L. Min , Y. Cho , C. S. Kim, LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies, IEEE Transactions on Computers, v.50 n.12, p.1352-1361, December 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Haakon Dybdahl , Per Stenström , Lasse Natvig, An LRU-based replacement algorithm augmented with frequency of access in shared chip-multiprocessor caches, Proceedings of the 2006 workshop on MEmory performance: DEaling with Applications, systems and architectures, p.45-52, September 16-20, 2006, Seattle, Washington
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Li Chen , Song Wang , Elizabeth Cash , Burke Ryder , Ian Hobbs , Elke A. Rundensteiner, A fine-grained replacement strategy for XML query cache, Proceedings of the 4th international workshop on Web information and data management, November 08-08, 2002, McLean, Virginia, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
|