Activities per year
Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Algorithm Theory -- SWAT 2012 : 13th Scandinavian Symposium and Workshops |
| Number of pages | 12 |
| Volume | 7357 |
| Publication date | 2012 |
| Pages | 328-339 |
| ISBN (Print) | 978-3-642-31154-3 |
| ISBN (Electronic) | 978-3-642-31155-0 |
| DOIs | |
| Publication status | Published - 2012 |
| Event | 13th Scandinavian Symposium and Workshops on Algorithm Theory - Helsinki, Finland Duration: 4. Jul 2012 → 6. Jul 2012 Conference number: 13 |
Conference
| Conference | 13th Scandinavian Symposium and Workshops on Algorithm Theory |
|---|---|
| Number | 13 |
| Country/Territory | Finland |
| City | Helsinki |
| Period | 04/07/2012 → 06/07/2012 |
| Series | Lecture Notes in Computer Science |
|---|---|
| ISSN | 0302-9743 |
Fingerprint
Dive into the research topics of 'Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis'. Together they form a unique fingerprint.Related activities
-
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
Boyar, J. (Lecturer)
14. Dec 2012Activity: Talks and presentations › Talks and presentations in private or public companies
-
13th Scandinavian Symposium and Workshops on Algorithm Theory
Boyar, J. (Participant)
4. Jul 2012 → 6. Jul 2012Activity: Attending an event › Conference organisation or participation