The weighted 2-server problem

DOI10.1016/j.tcs.2004.05.020zbMath1072.68018OpenAlexW2055082225MaRDI QIDQ1887090

Jiří Sgall, Marek Chrobak

Publication date: 23 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.020

zbMATH Keywords

Online algorithms\(k\)-Server problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (6)

The \(k\)-server problem ⋮ Calculating lower bounds for caching problems ⋮ Metrical service systems with multiple servers ⋮ Online chasing problems for regular polygons ⋮ A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem ⋮ Memoryless algorithms for the generalized k-server problem on uniform metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better lower bound on the competitive ratio of the randomized 2-server problem
• Searching in the plane
• A strongly competitive randomized paging algorithm
• Shortest paths without a map
• On the power of randomization in on-line algorithms
• Competitive algorithms for the weighted server problem
• The 2-evader problem
• More on weighted servers or FIFO is better than LRU.
• Competitive analysis of randomized paging algorithms
• A randomized algorithm for two servers on the line.
• A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
• Random walks on weighted graphs and applications to on-line algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• On fast algorithms for two servers
• On the k -server conjecture
• The harmonic k -server algorithm is competitive

This page was built for publication: The weighted 2-server problem