Optimal control of demand-paging systems
From MaRDI portal
Publication:1229618
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- scientific article; zbMATH DE number 3473307 (Why is no real title available?)
- scientific article; zbMATH DE number 3316542 (Why is no real title available?)
- scientific article; zbMATH DE number 3365976 (Why is no real title available?)
- scientific article; zbMATH DE number 3402098 (Why is no real title available?)
- A Unified Approach to the Evaluation of a Class of Replacement Algorithms
- Empirically Derived Micromodels for Sequences of Page Exceptions
- Finding Optimal Demand Paging Algorithms
- Locality in Page Reference Strings
- Markov models of page replacement in a two-level (virtual) computer memory
- Principles of Optimal Page Replacement
This page was built for publication: Optimal control of demand-paging systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229618)