Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
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.
Unable to display preview. Download preview PDF.
- 4.Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)Google Scholar
- 6.Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. ACM Transactions on Algorithms 3(2), article no. 22 (2007)Google Scholar
- 8.Boyar, J., Gupta, S., Larsen, K.S.: Access graphs results for LRU versus FIFO under relative worst order analysis, arXiv:1204.4047v1 [cs.DS] (2012)Google Scholar
- 14.Fiat, A., Karlin, A.R.: Randomized and multipointer paging with locality of reference. In: 27th Annual ACM Symposium on Theory of Computing, pp. 626–634 (1995)Google Scholar
- 15.Fiat, A., Mendel, M.: Truly online paging with locality of reference. In: 38th Annual Symposium on Foundations of Computer Science, pp. 326–335 (1997), extended version: CoRR, abs/cs/0601127 (2006)Google Scholar
- 16.Fiat, A., Rosen, Z.: Experimental studies of access graph based heuristics: Beating the LRU standard? In: 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 63–72 (1997)Google Scholar
- 17.Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Systems Tech. Journal 45(9), 1563–1581 (1966)Google Scholar