The optimal structure of algorithms for -paging
From MaRDI portal
Recommendations
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- A strongly competitive randomized paging algorithm
- 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; zbMATH DE number 4201604
- Strongly Competitive Algorithms for Paging with Locality of Reference
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- A strongly competitive randomized paging algorithm
- Beyond Competitive Analysis
- Competitive algorithms for the weighted server problem
- Competitive analysis of randomized paging algorithms
- Competitive snoopy caching
- Flexible reference trace reduction for VM simulations
- Minimizing Cache Usage in Paging
- Online Paging for Flash Memory Devices
- Online algorithms: a survey
- OnlineMin: a fast strongly competitive randomized paging algorithm
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Paging with request sets
Cited in
(7)- An optimality proof of the LRU- K page replacement algorithm
- scientific article; zbMATH DE number 1984695 (Why is no real title available?)
- Engineering efficient paging algorithms
- Competitive Analysis of Flash-Memory Algorithms
- scientific article; zbMATH DE number 4201604 (Why is no real title available?)
- Competitive analysis of flash memory algorithms
- Parameterized Analysis of Paging and List Update Algorithms
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)
