Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
From MaRDI portal
Publication:2904568
DOI10.1007/978-3-642-31155-0_29zbMath1357.68299arXiv1204.4047OpenAlexW142260489MaRDI QIDQ2904568
Sushmita Gupta, Kim S. Larsen, Joan. Boyar
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4047
Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)
Related Items (10)
Quantifying Competitiveness in Paging with Locality of Reference ⋮ Online bin covering: expectations vs. guarantees ⋮ Online Multi-Coloring with Advice ⋮ Relative Worst-Order Analysis: A Survey ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Relative interval analysis of paging algorithms on access graphs ⋮ Quantifying competitiveness in paging with locality of reference ⋮ A Survey of Algorithms and Models for List Update ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ Online multi-coloring with advice
This page was built for publication: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
