On Optimal Performance in Self-Organizing Paging Algorithams

DOI10.1080/02522667.1980.10698663zbMath0461.68073OpenAlexW1968608838MaRDI QIDQ3911416

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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Transience and recurrence of an interesting Markov chain
• Finding Optimal Demand Paging Algorithms
• On a model for storage and search
• An extension of a theorem concerning an interesting Markov chain
• On Serial Files with Relocatable Records
• Principles of Optimal Page Replacement
• The stationary distribution of an interesting Markov chain
• A Unified Approach to the Evaluation of a Class of Replacement Algorithms

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