A unified analysis of paging and caching

DOI10.1007/PL00009192zbMath0895.68058OpenAlexW2047034252MaRDI QIDQ1386377

Eric Torng

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009192

zbMATH Keywords

pagingcaching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (13)

On list update with locality of reference ⋮ On the relative dominance of paging algorithms ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Measuring the problem-relevant information in input ⋮ The relative worst-order ratio applied to paging ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ On paging with locality of reference ⋮ 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 ⋮ List Update with Locality of Reference ⋮ A Survey of Algorithms and Models for List Update ⋮ Parameterized analysis of paging and list update algorithms

This page was built for publication: A unified analysis of paging and caching