Engineering efficient paging algorithms

DOI10.1145/2670127zbMATH Open1347.68373OpenAlexW2009009792MaRDI QIDQ2828192FDOQ2828192

Authors: Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert 

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

Recommendations

• Paging on a RAM with Limited Resources
• On paging with locality of reference
• Minimizing Cache Usage in Paging
• The optimal structure of algorithms for \(\alpha\)-paging
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm

zbMATH Keywords

pagingalgorithm engineering

Mathematics Subject Classification ID

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

Cites Work

• Competitive paging with locality of reference
• Competitive snoopy caching
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• A strongly competitive randomized paging algorithm
• The relative worst-order ratio applied to paging
• Beyond Competitive Analysis
• Title not available (Why is that?)
• OnlineMin: a fast strongly competitive randomized paging algorithm
• Flexible reference trace reduction for VM simulations
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• Knowledge state algorithms

Cited In (1)

• Minimizing Cache Usage in Paging

Uses Software

• OnlineMin

This page was built for publication: Engineering efficient paging algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828192)