Engineering Efficient Paging Algorithms

DOI10.1145/2670127zbMath1347.68373OpenAlexW2009009792MaRDI QIDQ2828192

Volker Weichert, Gabriel Moruz, Christian Neumann, Andrei Negoescu

Publication date: 24 October 2016

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2670127

zbMATH Keywords

pagingalgorithm engineering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27)

Uses Software

• OnlineMin

Cites Work

• Unnamed Item
• Unnamed Item
• Knowledge state algorithms
• A strongly competitive randomized paging algorithm
• The relative worst-order ratio applied to paging
• Competitive snoopy caching
• Competitive analysis of randomized paging algorithms
• Competitive paging with locality of reference
• OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
• Competitive paging algorithms
• Beyond Competitive Analysis
• Flexible reference trace reduction for VM simulations

This page was built for publication: Engineering Efficient Paging Algorithms