The optimal structure of algorithms for -paging
From MaRDI portal
Publication:495673
DOI10.1016/J.IPL.2015.07.011zbMATH Open1338.68064OpenAlexW1009057809MaRDI QIDQ495673FDOQ495673
Authors: Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu 
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
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
- scientific article
- Strongly Competitive Algorithms for Paging with Locality of Reference
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
- Outperforming LRU via competitive analysis on parametrized inputs for paging
Cited In (8)
- On the smoothness of paging algorithms
- An optimality proof of the LRU- K page replacement algorithm
- Title not available (Why is that?)
- Competitive Analysis of Flash-Memory Algorithms
- Engineering efficient paging algorithms
- Title not available (Why is that?)
- Competitive analysis of flash memory algorithms
- Parameterized Analysis of Paging and List Update Algorithms
Uses Software
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)
