Journal ArticleDOI
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
TLDR
An automaton theoretic model of replacement algorithms is introduced for the class of ``random partially preloaded'' replacement algorithms, which contain certain algorithms of practical and theoretical interest and it is shown that the well-known page replacement algorithms FIFO and RAND yield the same long-run page-fault rates.Abstract:
The replacement problem arises in computer system management whenever the executable memory space available is insufficient to contain all data and code that 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 that selects code or data items that 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 contain 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.read more
Citations
More filters
Journal ArticleDOI
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
TL;DR: A unified framework for the analysis of a class of random allocation processes that include the birthday paradox, the coupon collector problem, least-recently-used caching in memory management systems under the independent reference model and the move-to-front heuristic of self-organizing search is introduced.
Journal ArticleDOI
Working Sets Past and Present
TL;DR: This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance and suggests that a working set dispatcher should be considered.
Journal ArticleDOI
An evaluation of buffer management strategies for relational database systems
Hong-Tai Chou,David J. DeWitt +1 more
TL;DR: A new algorithm, DBMIN, for managing the buffer pool of a relational database management system based on a new model of relational query behavior, the query locality set model (QLSM), and a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment is presented.
Proceedings ArticleDOI
A versatile and accurate approximation for LRU cache performance
TL;DR: The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law.
Posted Content
A versatile and accurate approximation for LRU cache performance
TL;DR: Che et al. as discussed by the authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy, which proves remarkably accurate and is applicable to quite general distributions of object popularity.
References
More filters
Journal ArticleDOI
Finite Markov Chains.
TL;DR: This lecture reviews the theory of Markov chains and introduces some of the high quality routines for working with Markov Chains available in QuantEcon.jl.
Journal ArticleDOI
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
Journal ArticleDOI
Principles of Optimal Page Replacement
TL;DR: A formal model is presented for paging algorithms under /-order nonstationary assumptions about program behavior that is expressed as a dynamic programming problem whose solution yields an optimal replacement algorithm.