More on weighted servers or FIFO is better than LRU.
From MaRDI portal
Publication:1426456
DOI10.1016/S0304-3975(03)00287-1zbMath1060.68143MaRDI QIDQ1426456
Leah Epstein, Rob van Stee, Csanád Imreh
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68W05: Nonnumerical algorithms
Related Items
Paging with connections: FIFO strikes again, The weighted 2-server problem, Calculating lower bounds for caching problems
Cites Work
- Unnamed Item
- Competitive snoopy caching
- LRU is better than FIFO
- Competitive algorithms for the weighted server problem
- On-line file caching
- Trackless online algorithms for the server problem
- Limited bookmark randomized online algorithms for the paging problem
- Competitive algorithms for server problems
- Competitive Algorithms for Relaxed List Update and Multilevel Caching