On the Relative Dominance of Paging Algorithms
From MaRDI portal
Publication:5387781
DOI10.1007/978-3-540-77120-3_43zbMath1193.68056OpenAlexW2154244688MaRDI QIDQ5387781
J. Ian Munro, Reza Dorrigiv, Alejandro López-Ortiz
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_43
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Theory of operating systems (68N25)
Related Items (3)
On the relative dominance of paging algorithms ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new measure for the study of on-line algorithms
- On the influence of lookahead in competitive paging algorithms
- On-line file caching
- Competitive paging with locality of reference
- On adequate performance measures for paging
- Beyond Competitive Analysis
- On-Line Paging Against Adversarially Biased Random Inputs
- Algorithm Theory - SWAT 2004
- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
- Algorithms – ESA 2004
- On paging with locality of reference
This page was built for publication: On the Relative Dominance of Paging Algorithms
