Relative Interval Analysis of Paging Algorithms on Access Graphs

Joan Boyar, Sushmita Gupta, Kim Skak Larsen

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.
OriginalsprogEngelsk
TitelAlgorithms and Data Structures - 13th International Symposium, WADS 2013
Vol/bind8037
ForlagSpringer
Publikationsdato2013
Sider195-206
ISBN (Trykt)978-3-642-40103-9
DOI
StatusUdgivet - 2013
BegivenhedAlgorithms & Data Structures Symposium - University of Western Ontario, London, Ontario, Canada
Varighed: 12. aug. 201314. aug. 2013

Konference

KonferenceAlgorithms & Data Structures Symposium
LokationUniversity of Western Ontario
LandCanada
ByLondon, Ontario
Periode12/08/201314/08/2013
NavnLecture Notes in Computer Science
ISSN0302-9743

Emneord

  • online algorithms
  • paging
  • relative interval analysis
  • access graphs

Citationsformater