Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
The working set model for program behavior
Communications of the ACM
SIAM Journal on Computing
SIAM Journal on Computing
On paging with locality of reference
Journal of Computer and System Sciences
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Software Engineering
On the relative dominance of paging algorithms
Theoretical Computer Science
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
Access graphs, which have been used previously in connection with competitive analysis and relative worst order analysis to model locality of reference in paging, are considered in connection with relative interval analysis. The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained. However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model. We solve an open question from [Dorrigiv, López-Ortiz, Munro, 2009], obtaining tight bounds on the relationship between LRU and FIFO with relative interval analysis.