Quantifying competitiveness in paging with locality of reference
From MaRDI portal
Recommendations
Cites work
- A new measure for the study of on-line algorithms
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
- Algorithms – ESA 2004
- Beyond Competitive Analysis
- Competitive paging with locality of reference
- LRU is better than FIFO
- Markov Paging
- On adequate performance measures for paging
- On paging with locality of reference
- On the relative dominance of paging algorithms
- On the separation and equivalence of paging strategies
- Paging and list update under bijective analysis
- Parameterized analysis of paging and list update algorithms
- Relative interval analysis of paging algorithms on access graphs
- Strongly Competitive Algorithms for Paging with Locality of Reference
- The relative worst-order ratio applied to paging
Cited in
(10)- Algorithms – ESA 2004
- scientific article; zbMATH DE number 65707 (Why is no real title available?)
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Quantifying competitiveness in paging with locality of reference
- scientific article; zbMATH DE number 1263239 (Why is no real title available?)
- On Certain New Models for Paging with Locality of Reference
- On paging with locality of reference
- On-Line Paging Against Adversarially Biased Random Inputs
- On adequate performance measures for paging
- Parameterized analysis of paging and list update algorithms
This page was built for publication: Quantifying competitiveness in paging with locality of reference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799211)
