- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
- Joan Boyar, Sushmita Gupta, and Kim S. Larsen.
In 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), volume 7357 of Lecture Notes in Computer Science, pages 328-339. Springer, 2012.
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.
- Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any):
The final publication is available at link.springer.com.
open access (157 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.