A Caltech Library Service

Finding Optimal Demand Paging Algorithms

Ingargiola, Giorgio and Korsh, James F. (1974) Finding Optimal Demand Paging Algorithms. Journal of the ACM, 21 (1). pp. 40-53. ISSN 0004-5411. doi:10.1145/321796.321801.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 1974 ACM. Received October 1971; revised March 1973. This research was supported by the National Science Foundation (GJ-28424).
Funding AgencyGrant Number
Subject Keywords:demand paging, dynamic programming, policy iteration, program behavior, stochastic modeling
Issue or Number:1
Classification Code:CR CATEGORIES: 4.32, 5.42, 5.5
Record Number:CaltechAUTHORS:20161107-155825897
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:71783
Deposited On:08 Nov 2016 00:07
Last Modified:11 Nov 2021 04:51

Repository Staff Only: item control page