Finding Optimal Demand Paging Algorithms

Authors:
Giorgio Ingargiola;James F. Korsh
Affiliations:
California Institute of Technology, Pasadena, California;Department of Information Sciences, Temple University, School of Business Adminsitration, Philadelphia, PA and California Institute of Technology, Pasadena, California
Venue:
Journal of the ACM (JACM)
Year:
1974

Citing 3
Cited 5

Principles of Optimal Page Replacement

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)

An Approach to Program Behavior Modeling and Optimal Memory Control

Journal of the ACM (JACM)
Bibliography on paging and related topics

ACM SIGOPS Operating Systems Review
The optimal choice of window sizes for working set dispatching

SIGMETRICS '74 Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation
Optimal control of demand-paging systems

Information Sciences: an International Journal
Brief paper: Stochastic control of paging in a two-level computer memory

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.01

Visualization

Abstract

A cost is defined for demand paging algorithms with respect to a formal stochastic model of program behavior. This cost is shown to exist under rather general assumptions, 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. In this latter case it is shown that these computational procedures may be extended to larger programs to obtain arbitrarily close approximations to their optimal policies. In previous models either unwarranted information is assumed beyond the formal model, or the complete stochastic nature of the model is not taken into account.