On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies

On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies (1999)

Cached

Download Links

[www.cs.biu.ac.il]
[www.cs.ucsb.edu]
[ssrnet.snu.ac.kr]

Other Repositories/Bibliography

DBLP

by Donghee Lee , Jongmoo Choi , Jong-hun Kim , Sam H. Noh , Sang Lyul Min , Yookun Cho

Venue:	In Proceedings of the 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems
Citations:	87 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies	INFERENCE
AUTHOR NAME	Donghee Lee	SVM HeaderParse 0.2
AUTHOR NAME	Jongmoo Choi	SVM HeaderParse 0.2
AUTHOR NAME	Jong-hun Kim	SVM HeaderParse 0.2
AUTHOR NAME	Sam H. Noh	SVM HeaderParse 0.2
AUTHOR NAME	Sang Lyul Min	SVM HeaderParse 0.2
AUTHOR NAME	Yookun Cho	SVM HeaderParse 0.2
ABSTRACT	AbstractÐEfficient and effective buffering of disk blocks in main memory is critical for better file system performance due to a wide speed gap between main memory and hard disks. In such a buffering system, one of the most important design decisions is the block replacement policy that determines which disk block to replace when the buffer is full. In this paper, we show that there exists a spectrum of block replacement policies that subsumes the two seemingly unrelated and independent Least Recently Used (LRU) and Least Frequently Used (LFU) policies. The spectrum is called the LRFU (Least Recently/Frequently Used) policy and is formed by how much more weight we give to the recent history than to the older history. We also show that there is a spectrum of implementations of the LRFU that again subsumes the LRU and LFU implementations. This spectrum is again dictated by how much weight is given to recent and older histories and the time complexity of the implementations lies between O(1) (the time complexity of LRU) and O…log 2 n† (the time complexity of LFU), where n is the number of blocks in the buffer. Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads we considered. Index TermsÐBuffer cache, LFU, LRU, replacement policy, trace-driven simulation. 1	SVM HeaderParse 0.2
YEAR	1999	INFERENCE
VENUE	In Proceedings of the 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	134--143	INFERENCE
VOLUME	50	INFERENCE
CITATIONS	26 found	ParsCit 1.0