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. © 2013 Springer-Verlag.
CITATION STYLE
Boyar, J., Gupta, S., & Larsen, K. S. (2013). Relative interval analysis of paging algorithms on access graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8037 LNCS, pp. 195–206). https://doi.org/10.1007/978-3-642-40104-6_17
Mendeley helps you to discover research relevant for your work.