The optimal structure of algorithms for \(\alpha\)-paging
From MaRDI portal
Publication:495673
DOI10.1016/j.ipl.2015.07.011zbMath1338.68064OpenAlexW1009057809MaRDI QIDQ495673
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A strongly competitive randomized paging algorithm
- Competitive snoopy caching
- Competitive algorithms for the weighted server problem
- Online algorithms: a survey
- Competitive analysis of randomized paging algorithms
- Paging with request sets
- Minimizing Cache Usage in Paging
- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
- Online Paging for Flash Memory Devices
- Beyond Competitive Analysis
- Flexible reference trace reduction for VM simulations
This page was built for publication: The optimal structure of algorithms for \(\alpha\)-paging