More on weighted servers or FIFO is better than LRU.

DOI10.1016/S0304-3975(03)00287-1zbMath1060.68143MaRDI QIDQ1426456

Rob van Stee, Csanád Imreh, Leah Epstein

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Weights\(k\)-Server problemTrackless algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (3)

The weighted 2-server problem ⋮ Paging with connections: FIFO strikes again ⋮ 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

This page was built for publication: More on weighted servers or FIFO is better than LRU.