Brief paper: Stochastic control of paging in a two-level computer memory

Authors:
O. I. Aven;Ya. A. Kogan
Affiliations:
The authors are with the Institute of Control Sciences, Moscow GSP-312, U.S.S.R.;The authors are with the Institute of Control Sciences, Moscow GSP-312, U.S.S.R.
Venue:
Automatica (Journal of IFAC)
Year:
1975

Citing 11
Cited 0

Principles of Optimal Page Replacement

Journal of the ACM (JACM)
Some Distribution-Free Aspects of Paging Algorithm Performance

Journal of the ACM (JACM)
Finding Optimal Demand Paging Algorithms

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
Computation of page fault probability from program transition diagram

Communications of the ACM
Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix

Communications of the ACM
Finite State Markovian Decision Processes

Finite State Markovian Decision Processes
Virtual storage and virtual machine concepts

IBM Systems Journal
Evaluation techniques for storage hierarchies

IBM Systems Journal
On-line measurement of paging behavior by the multivalued MIN algorithm

IBM Journal of Research and Development
Empirically derived micromodels for sequences of page exceptions

IBM Journal of Research and Development

Quantified Score

Hi-index	22.14

Visualization

Abstract

A paging memory system of a computer is formulated as a Markovian decision process on an infinite time period. 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. Sufficient conditions are proposed for a given set of pages to be nonreplacable for an optimal algorithm. Numerical results are obtained for comparing paging algorithms for moderate size programs.