Aktiviteter pr. år
Abstract
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.
Originalsprog | Engelsk |
---|---|
Titel | Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings |
Vol/bind | 8037 |
Forlag | Springer |
Publikationsdato | 2013 |
Sider | 195-206 |
ISBN (Trykt) | 978-3-642-40103-9 |
DOI | |
Status | Udgivet - 2013 |
Begivenhed | Algorithms & Data Structures Symposium - University of Western Ontario, London, Ontario, Canada Varighed: 12. aug. 2013 → 14. aug. 2013 |
Konference
Konference | Algorithms & Data Structures Symposium |
---|---|
Lokation | University of Western Ontario |
Land/Område | Canada |
By | London, Ontario |
Periode | 12/08/2013 → 14/08/2013 |
Navn | Lecture Notes in Computer Science |
---|---|
ISSN | 0302-9743 |
Emneord
- online algorithms
- paging
- relative interval analysis
- access graphs
Fingeraftryk
Dyk ned i forskningsemnerne om 'Relative Interval Analysis of Paging Algorithms on Access Graphs'. Sammen danner de et unikt fingeraftryk.Relaterede aktiviteter
- 1 Organisering af eller deltagelse i workshop, kursus, seminar eller lignende
-
Algorithms & Data Structures Symposium
Boyar, J. (Deltager)
11. aug. 2013 → 14. aug. 2013Aktivitet: Deltagelse i faglig begivenhed › Organisering af eller deltagelse i workshop, kursus, seminar eller lignende