On paging with locality of reference

DOI10.1016/j.jcss.2004.08.002zbMath1068.68044MaRDI QIDQ5916194

Susanne Albers, Oliver Giel, Lene Monrad Favrholdt

Publication date: 12 May 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.08.002

zbMATH Keywords

Paging; Fault rate; Locality of reference

Mathematics Subject Classification ID

68N25: Theory of operating systems

Related Items

On the Relative Dominance of Paging Algorithms, Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis, On Certain New Models for Paging with Locality of Reference, List Update with Locality of Reference, On list update with locality of reference, Optimal eviction policies for stochastic address traces, On the relative dominance of paging algorithms, The relative worst-order ratio applied to paging, Parameterized analysis of paging and list update algorithms, Online multi-coloring with advice, Relative interval analysis of paging algorithms on access graphs, A Survey of Algorithms and Models for List Update, Quantifying Competitiveness in Paging with Locality of Reference, Online Multi-Coloring with Advice

Cites Work

• A unified analysis of paging and caching
• Competitive paging with locality of reference
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Strongly Competitive Algorithms for Paging with Locality of Reference
• The working set model for program behavior
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item