Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Finding Optimal Demand Paging Algorithms
Journal of the ACM (JACM)
Memory allocation in paging systems
ACM '73 Proceedings of the ACM annual conference
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
Virtual storage and virtual machine concepts
IBM Systems Journal
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
Empirically derived micromodels for sequences of page exceptions
IBM Journal of Research and Development
| Hi-index | 0.07 |
Demand-paging systems are characterized as stochastic control processes, and optimal page replacement decisions are determined by means of dynamic programming. This approach is distinguished from others by its utilization of page structure information, which may be either supplied a priori or else dynamically learned. The main result is an optimal realizable solution for a general class of replacement problems. The resulting algorithm subsumes others (including ''A"0'') as special cases.