Stochastic control of paging in a two-level computer memory
From MaRDI portal
Publication:1219164
DOI10.1016/0005-1098(75)90046-1zbMath0309.68060OpenAlexW2527733085MaRDI QIDQ1219164
Publication date: 1975
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(75)90046-1
Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Cites Work
- Unnamed Item
- Unnamed Item
- Control of multilevel memory in computer systems (survey)
- Finite state Markovian decision processes
- Some Distribution-Free Aspects of Paging Algorithm Performance
- Computation of page fault probability from program transition diagram
- Finding Optimal Demand Paging Algorithms
- On-line Measurement of Paging Behavior by the Multivalued MIN Algorithm
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
- Principles of Optimal Page Replacement
- Empirically Derived Micromodels for Sequences of Page Exceptions
This page was built for publication: Stochastic control of paging in a two-level computer memory