Optimal control of demand-paging systems

DOI10.1016/S0020-0255(76)90962-2zbMath0335.90011MaRDI QIDQ1229618

Art Lew

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Decision theory (91B06) Inventory, storage, reservoirs (90B05) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items (1)

\(N\) degrees of separation: Influences of dynamic programming on computer science

Cites Work

• Markov models of page replacement in a two-level (virtual) computer memory
• Finding Optimal Demand Paging Algorithms
• Principles of Optimal Page Replacement
• Locality in Page Reference Strings
• A Unified Approach to the Evaluation of a Class of Replacement Algorithms
• Empirically Derived Micromodels for Sequences of Page Exceptions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal control of demand-paging systems