LRU is better than FIFO

DOI10.1007/PL00009255zbMath0918.68039OpenAlexW3136960240MaRDI QIDQ1277395

Marek Chrobak, John Noga

Publication date: 17 August 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009255

zbMATH Keywords

competitive analysispaging problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (14)

On the relative dominance of paging algorithms ⋮ Quantifying Competitiveness in Paging with Locality of Reference ⋮ The relative worst-order ratio applied to paging ⋮ Paging with connections: FIFO strikes again ⋮ Relative Worst-Order Analysis: A Survey ⋮ More on weighted servers or FIFO is better than LRU. ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Calculating lower bounds for caching problems ⋮ Weighted online problems with advice ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ 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 ⋮ Parameterized analysis of paging and list update algorithms

This page was built for publication: LRU is better than FIFO