Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
- 1 December 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (4) , 743-757
- https://doi.org/10.1137/0205052
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Some Distribution-Free Aspects of Paging Algorithm PerformanceJournal of the ACM, 1974
- On-line Measurement of Paging Behavior by the Multivalued MIN AlgorithmIBM Journal of Research and Development, 1974
- A note on sub-expression ordering in the execution of arithmetic expressionsCommunications of the ACM, 1973
- Empirically Derived Micromodels for Sequences of Page ExceptionsIBM Journal of Research and Development, 1973
- Properties of the working-set modelCommunications of the ACM, 1972
- Principles of Optimal Page ReplacementJournal of the ACM, 1971
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- The working set model for program behaviorCommunications of the ACM, 1968
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966
- One-Level Storage SystemIEEE Transactions on Electronic Computers, 1962