Hostname: page-component-7dd5485656-bt4hw Total loading time: 0 Render date: 2025-10-31T09:50:31.245Z Has data issue: false hasContentIssue false
  • English
  • Français

LRU is better than FIFO under the independent reference model

Part of: Special processes Combinatorial probability Operations research and management science

Published online by Cambridge University Press:  14 July 2016

J. van den Berg  and
A. Gandolfi
J. van den Berg*
Affiliation:
CWI
A. Gandolfi*
Affiliation:
Courant Institute
*
∗ Postal address: CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands.
∗∗ Present address: Department of Statistics, 367 Evans Hall, University of California, Berkeley, CA 94720, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider a two-level storage system operating with the least recently used (LRU) or the first-in, first-out (FIFO) replacement strategy. Accesses to the main storage are described by the independent reference model (IRM). Using the FKG inequality, we prove that the miss ratio for LRU is smaller than or equal to the miss ratio for FIFO.

Keywords

REPLACEMENT ALGORITHMSFKG INEQUALITYMEMORY MANAGEMENTMISS RATIOFIFOLRU

MSC classification

Primary: 60C05: Combinatorial probability
Secondary: 90B05: Inventory, storage, reservoirs 60K99: None of the above, but in this section

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 29 , Issue 1 , March 1992 , pp. 239 - 243
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research carried out while the author was visiting Cornell University, Ithaca, NY, and partly supported by the US Army Research Office.

Research carried out while the author was visiting the University of California at Davis.

References

Aven, O. I. and Sokolov, V. B. (1971) On some methods of memory management (in Russian) Tech. Cybernet. 2, 89–94.Google Scholar
Aven, O. L, Coffman, E. G. Jr., and Kogan, Y. A. (1987) Stochastic Analysis of Computer Storage. Reidel, Dordrecht.Google Scholar
van den Berg, J. and Towsley, D. (1990) Properties of the miss ratio for a 2-level storage model with LRU or FIFO replacement strategy and independent references. Preprint.Google Scholar
Fortuin, C. M., Kasteleyn, P. W. and Ginibre, J. (1971) Correlation inequalities on some partially ordered sets. Comm. Math. Phys. 22, 89–103.Google Scholar
Harris, T. E. (1960) A lower bound for the critical probability in a certain percolation process. Proc. Camb. Phil. Soc. 56, 13–20.Google Scholar
King, W. F. (1971) Analysis of paging algorithms. Proc. IFIP Congress, Lyublyana, Yugoslavia, August 1971, 485–490.Google Scholar
Kan, Y. C. and Ross, S. M. (1980) Optimal list ordering under partial memory constraints. J. Appl. Prob. 17, 1004–1015.Google Scholar
Matick, R. E. (1977) Computer Storage and Technology. Wiley, New York.Google Scholar
Shepp, L. (1982) The XYZ conjecture and the FKG inequality. Ann. Prob. 10, 824–827.Google Scholar