Relative interval analysis of paging algorithms on access graphs
From MaRDI portal
Publication:2513607
DOI10.1016/j.tcs.2014.11.035zbMath1312.68235OpenAlexW191339864MaRDI QIDQ2513607
Sushmita Gupta, Kim S. Larsen, Joan. Boyar
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.035
Related Items
Relative Worst-Order Analysis: A Survey, On the separation and equivalence of paging strategies and other online algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of performance measures for online algorithms
- On the relative dominance of paging algorithms
- The relative worst-order ratio applied to paging
- Competitive snoopy caching
- LRU is better than FIFO
- A unified analysis of paging and caching
- Competitive paging with locality of reference
- List factoring and relative worst order analysis
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
- The relative worst order ratio for online algorithms
- Beyond Competitive Analysis
- Markov Paging
- On-Line Paging Against Adversarially Biased Random Inputs
- The working set model for program behavior
- On paging with locality of reference