On Optimal Performance in Self-Organizing Paging Algorithams

DOI10.1080/02522667.1980.10698663MaRDI QIDQ3911416zbMATH OpenOpenAlexFDO

Authors R. I. Phelps, Lyn C. Thomas

Publication date 1980

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1980.10698663

zbMATH Keywords

library problem

Mathematics Subject Classification ID

Theory of software (68N99) Discrete mathematics in relation to computer science (68R99)

Cites work

• A Unified Approach to the Evaluation of a Class of Replacement Algorithms
• An extension of a theorem concerning an interesting Markov chain
• Finding Optimal Demand Paging Algorithms
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• On a model for storage and search
• On Serial Files with Relocatable Records
• Principles of Optimal Page Replacement
• Some Distribution-Free Aspects of Paging Algorithm Performance
• The stationary distribution of an interesting Markov chain
• Transience and recurrence of an interesting Markov chain

Cited in

(1)

• MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM

This page was built for publication: On Optimal Performance in Self-Organizing Paging Algorithams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911416)