Relative Interval Analysis of Paging Algorithms on Access Graphs

Joan Boyar, Sushmita Gupta, Kim Skak Larsen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings
Publication date2013
ISBN (Print)978-3-642-40103-9
Publication statusPublished - 2013
EventAlgorithms & Data Structures Symposium - University of Western Ontario, London, Ontario, Canada
Duration: 12. Aug 201314. Aug 2013


ConferenceAlgorithms & Data Structures Symposium
LocationUniversity of Western Ontario
CityLondon, Ontario
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Relative Interval Analysis of Paging Algorithms on Access Graphs'. Together they form a unique fingerprint.

Cite this