Principles of Optimal Page Replacement

@article{Aho1971PrinciplesOO,
  title={Principles of Optimal Page Replacement},
  author={A. Aho and P. Denning and J. Ullman},
  journal={Journal of the ACM (JACM)},
  year={1971},
  volume={18},
  pages={80 - 93}
}
ABSTP~CT. [...] Key Method The minimum cost for /-order program behavior assumptions is expressed as a dynamic programming problem whose solution yields an optimal replacement algorithm. Solutions are exhibited in several 0-order cases of interest. Paging algorithms that implement and approximate the minimum cost are discussed.Expand
Brief paper: Stochastic control of paging in a two-level computer memory
TLDR
A compact expression for a performance index is derived and a computational procedure is given which makes it possible to determine the optimal performance index and optimal paging algorithm. Expand
Some Distribution-Free Aspects of Paging Algorithm Performance
TLDR
It is shown that simple algorithms exist which yield fault probabilities close to optimal with only a modest increase in memory, and performance bounds are obtained which are independent of the page request probabilities. Expand
On the Paging-Complexity of Periodic Arrangements
  • H. Stork
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1977
TLDR
The main objectives are to prove a locality principle for this type of program structure: Given a pagination, generate as many references as possible to the same page in order to minimize page-traffic. Expand
Memory Management for B-Trees
TLDR
This paper provides the analysis for two paging policies denoted LAP and LEC respectively and shows that the first policy is not optimal but nearly so and that the second is the optimal policy among a class of algorithms for sequences of independently chosen key references. Expand
Priority Paging Algorithms and the Extension Problem
TLDR
This paper formulated for demand paging systems shows that the class of replacement rules so defined is precisely that class of rules having the wellknown inclusion property. Expand
Computation of page fault probability from program transition diagram
An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A first order Markov model ofExpand
A decomposable model of program paging behaviour
TLDR
A model based on the distinction between short- and long-run equilibrium states in nearly completely decomposable systems is proposed to overcome this deficiency and is shown to give better estimations of the page fault rate and of the working set size distribution. Expand
The A0 inversion model of program paging behavior
TLDR
A model based on the independent reference model with a new procedure for determining the page reference probabilities is presented, which should be especially useful for evaluating multilevel memory organizations based on newly emerging memory technologies. Expand
Finding Optimal Demand Paging Algorithms
TLDR
A cost is defined for demand paging algorithms with respect to a formal stochastic model of program behavior, and a computational procedure is given which makes it possible to determine the optimal cost and optimal policy for moderate size programs, when the formal model is known and not time dependent. Expand
Performance of "Least Reference Probability" Paging Algorithm under Locality in Program Behavior
TLDR
Least Reference Probability (LRP) paging algorithm, which replaces the page the least likely to be required at next time, is shown to be (nearly) optimal via two original probabilistic models. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Dynamic program behavior under paging
In May, 1965, System Development Corporation (SDC) proposed to do some research to study program organization with respect to dynamic program behavior. Further, the proposal suggested that simulationExpand
An anomaly in space-time characteristics of certain programs running in a paging machine
The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse isExpand
Complementary replacement: a meta scheduling principle
TLDR
A principle of scheduling is presented that includes a wide class of time and space allocation problems met in time sharing and virtual systems and includes several known job dispatching rules as well as some page-replacement algorithms such as the MIN and LRU. Expand
Evaluation Techniques for Storage Hierarchies
TLDR
A new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms. Expand
Statistical Analysis of Paged and Segmented Computer Systems
TLDR
It is argued that design optimization depends fundamentally on the statistics of the typical software load presented to the computer system, and also that the investigation requires the aid of a total system model. Expand
Further experimental data on the behavior of programs in a paging environment
TLDR
The data collected from the interpretive execution of a number of paged programs are used to describe the frequency of page faults and are used also for the evaluation of page replacement algorithms and for assessing the effects on performance of changes in the amount of storage allocated to executing programs. Expand
Virtual Memory
TLDR
Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted and are shown to be controllable by a proper combination of hardware and memory management policies. Expand
A Study of Replacement Algorithms for Virtual-Storage Computer
TLDR
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. Expand
Microprogamming under a page on demand strategy
TLDR
A model of multiprogramming for a particular computer system using a page on demand strategy is developed and performance is predicted when user programs are typical of those arising from an interactive time sharing environment. Expand
Segmentation and the Design of Multiprogrammed Computer Systems
TLDR
The segmentation of procedures and data forms a model of program structure that is the basis of an address mapping function which will be a valuable feature of future computer systems. Expand
...
1
2
3
...