Quantifying Competitiveness in Paging with Locality of Reference
From MaRDI portal
Publication:3448771
DOI10.1007/978-3-662-47672-7_3zbMath1401.68366OpenAlexW1032693136MaRDI QIDQ3448771
Dario Frascaria, Susanne Albers
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://mediatum.ub.tum.de/doc/1524482/document.pdf
Cites Work
- Unnamed Item
- On the relative dominance of paging algorithms
- The relative worst-order ratio applied to paging
- LRU is better than FIFO
- A new measure for the study of on-line algorithms
- Competitive paging with locality of reference
- Relative Interval Analysis of Paging Algorithms on Access Graphs
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
- On adequate performance measures for paging
- Parameterized Analysis of Paging and List Update Algorithms
- Beyond Competitive Analysis
- Markov Paging
- Strongly Competitive Algorithms for Paging with Locality of Reference
- Paging and list update under bijective analysis
- Algorithms – ESA 2004
- On paging with locality of reference
This page was built for publication: Quantifying Competitiveness in Paging with Locality of Reference