- Relative Interval Analysis of Paging Algorithms on Access Graphs.
- Joan Boyar, Sushmita Gupta, and Kim S. Larsen.
Theoretical Computer Science, 568: 28-48, 2015.
Access graphs, which have been used previously in connection to
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 results obtained are not surprising. 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.
- Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any):
The publication is available from ScienceDirect.
open access (327 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.
Other publications by the author.