On paging with locality of reference
From MaRDI portal
Publication:5916194
DOI10.1016/j.jcss.2004.08.002zbMath1068.68044OpenAlexW1995038282MaRDI 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
Related Items (20)
On list update with locality of reference ⋮ Online-bounded analysis ⋮ On the relative dominance of paging algorithms ⋮ Quantifying Competitiveness in Paging with Locality of Reference ⋮ Online Multi-Coloring with Advice ⋮ The relative worst-order ratio applied to paging ⋮ Optimal eviction policies for stochastic address traces ⋮ Relative Worst-Order Analysis: A Survey ⋮ On the Relative Dominance of Paging Algorithms ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Unnamed Item ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ On Certain New Models for Paging with Locality of Reference ⋮ Relative interval analysis of paging algorithms on access graphs ⋮ Quantifying competitiveness in paging with locality of reference ⋮ List Update with Locality of Reference ⋮ A Survey of Algorithms and Models for List Update ⋮ Unnamed Item ⋮ Parameterized analysis of paging and list update algorithms ⋮ 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
This page was built for publication: On paging with locality of reference
