Engineering efficient paging algorithms

DOI10.1145/2670127MaRDI QIDQ2828192zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pagingalgorithm engineering

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 52160 (Why is no real title available?)
• A strongly competitive randomized paging algorithm
• Beyond Competitive Analysis
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Competitive paging with locality of reference
• Competitive snoopy caching
• Flexible reference trace reduction for VM simulations
• Knowledge state algorithms
• OnlineMin: a fast strongly competitive randomized paging algorithm
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• The relative worst-order ratio applied to paging

Cited in

(1)

• Minimizing Cache Usage in Paging

Describes a project that uses

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)