Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
The working set model for program behavior
Communications of the ACM
SIAM Journal on Computing
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Truly online paging with locality of reference
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
IEEE Transactions on Software Engineering
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The frequent items problem in online streaming under various performance measures
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families of graphs which grow with the length of the sequences.