The optimal structure of algorithms for -paging

DOI10.1016/J.IPL.2015.07.011zbMATH Open1338.68064OpenAlexW1009057809MaRDI QIDQ495673FDOQ495673

Andrei Negoescu, Annamária Kovács, Ulrich Meyer, Gabriel Moruz

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.011

zbMATH Keywords

online algorithmspagingempirical competitive ratio

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Title not available (Why is that?)
• Competitive snoopy caching
• Competitive analysis of randomized paging algorithms
• A strongly competitive randomized paging algorithm
• Online algorithms: a survey
• Beyond Competitive Analysis
• Competitive algorithms for the weighted server problem
• Paging with request sets
• Minimizing Cache Usage in Paging
• OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
• Online Paging for Flash Memory Devices
• Flexible reference trace reduction for VM simulations
• Title not available (Why is that?)

Cited In (5)

• On the smoothness of paging algorithms
• An optimality proof of the LRU- K page replacement algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parameterized Analysis of Paging and List Update Algorithms

Uses Software

• OnlineMin

   Recommendations

• A proof of the optimality of the MIN paging algorithm using linear programming duality 👍 👎
• A strongly competitive randomized paging algorithm 👍 👎
• On the smoothness of paging algorithms 👍 👎
• On the smoothness of paging algorithms 👍 👎
• The work function algorithm for the paging problem 👍 👎
• On the relative dominance of paging algorithms 👍 👎
• On the Relative Dominance of Paging Algorithms 👍 👎
• Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms 👍 👎
• Title not available (Why is that?) 👍 👎
• Strongly Competitive Algorithms for Paging with Locality of Reference 👍 👎

This page was built for publication: The optimal structure of algorithms for \(\alpha\)-paging

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