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. © 2012 Springer-Verlag.
CITATION STYLE
Boyar, J., Gupta, S., & Larsen, K. S. (2012). Access graphs results for LRU versus FIFO under relative worst order analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 328–339). https://doi.org/10.1007/978-3-642-31155-0_29
Mendeley helps you to discover research relevant for your work.