On paging with locality of reference
From MaRDI portal
Publication:5901047
DOI10.1145/509907.509949zbMath1192.68271OpenAlexW1966338819MaRDI QIDQ5901047
Lene Monrad Favrholdt, Susanne Albers, Oliver Giel
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509949
Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25)
Related Items (2)
The cost of offline binary search tree algorithms and the complexity of the request sequence ⋮ Online Bounded Analysis
This page was built for publication: On paging with locality of reference