Abstract
The replacement problem arises in computer system management whenever the executable memory space available is insufficient to contain all data and code which may be accessed during the execution of an ensemble of programs. An example of this is the page replacement problem in virtual memory computers. The problem is solved by using a replacement algorithm which selects code or data items which are to be removed from executable memory whenever new items must be brought in and no more free storage space remains. An automaton-theoretic model of replacement algorithms is introduced for the class of “random, partially preloaded” replacement algorithms, which contains certain algorithms of practical and theoretical interest. An analysis of this class is provided in order to evaluate their performance, using the assumption that the references to the items to be stored are identically distributed, independent random variables. With this model it is shown that the well-known page replacement algorithms FIFO and RAND yield the same long-run page fault rates.
Work supported in part by the Office of Naval Research, by a Rackham Research Grant, and by Projêt SPECTRE at IRIA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Randell and C. J. Kuehner. Dynamic Storage Allocation Systems,Commun. ACM11 (5), 297–305 (1968).
L. A. Belady, A Study of Replacement Algorithms for a Virtual Storage Computer,IBM Sys. J 5(2), 78–101 (July 1966).
W. F. King III, Analysis of Paging Algorithms, IBM Research Report RC 3288 (March 1971).
A. V. Aho, P. Denning, and J. D. Ullman, Principles of Optimal Page Replacement,J. ACM 18(1), 80–93 (1971).
J. G. Kemeny and J. L. Snell,Finite Markov Chains, Van Nostrand, Princeton, New Jersey (1960).
T. L. Booth,Sequential Machines and Automata Theory, Wiley, New York (1967).
P. J. Denning and S. C. Schwartz, Properties of the Working Set Model, inACM Third Symp. on Operating Systems Principles, (October 1971), pp. 130–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Plenum Press, New York
About this chapter
Cite this chapter
Gelenbe, E. (1974). A Unified Approach to the Evaluation of a Class of Replacement Algorithms. In: Tou, J.T. (eds) Information Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-2694-6_18
Download citation
DOI: https://doi.org/10.1007/978-1-4684-2694-6_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-2696-0
Online ISBN: 978-1-4684-2694-6
eBook Packages: Springer Book Archive