Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-23T00:29:15.286Z Has data issue: false hasContentIssue false
  • English
  • Français

On the optimality of the ‘least frequently used’ page replacement algorithm

Published online by Cambridge University Press:  01 July 2016

A. Kramli  and
J. Soltesz
A. Kramli
Affiliation:
Computer and Automation Institute, Hungarian Academy of Sciences
J. Soltesz
Affiliation:
Computer and Automation Institute, Hungarian Academy of Sciences
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
III. Workshop on Computer System Modelling
Information
Advances in Applied Probability , Volume 10 , Issue 2 , June 1978 , pp. 338
Copyright
Copyright © Applied Probability Trust 1978 

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.)

References

[1] Aho, A. V., Denning, P. J. and Ullman, J. D. (1971) Principles of optimal page replacement. J. Assoc. Comput. Mach. 18, 80–93.CrossRefGoogle Scholar
[2] Benzúr, A., Krámli, A. and Pergel, J. (1977) On the Bayesian approach to optimal performance of page storage hierarchies. Acta Cybernet. 3 (2), 79–89.Google Scholar