The weighted 2-server problem

DOI10.1016/J.TCS.2004.05.020MaRDI QIDQ1887090zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Jiří Sgall

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

\(k\)-Server problemOnline algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1500546
• Randomized memoryless algorithms for the weighted and the generalized k-server problems
• A competitive 2-server algorithm
• Randomized Competitive Analysis for Two-Server Problems
• New Ressults on Server Problems

Cites work

• A better lower bound on the competitive ratio of the randomized 2-server problem
• A decomposition theorem for task systems and bounds for randomized server problems
• A randomized algorithm for two servers on the line.
• A strongly competitive randomized paging algorithm
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• Competitive algorithms for the weighted server problem
• Competitive analysis of randomized paging algorithms
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2038743 (Why is no real title available?)
• scientific article; zbMATH DE number 1500545 (Why is no real title available?)
• scientific article; zbMATH DE number 1500546 (Why is no real title available?)
• scientific article; zbMATH DE number 1559591 (Why is no real title available?)
• More on weighted servers or FIFO is better than LRU.
• New Ressults on Server Problems
• On fast algorithms for two servers
• On the k -server conjecture
• On the power of randomization in on-line algorithms
• Random walks on weighted graphs and applications to on-line algorithms
• Searching in the plane
• Shortest paths without a map
• The 2-evader problem
• The harmonic k -server algorithm is competitive

Cited in

(12)

• More on weighted servers or FIFO is better than LRU.
• Memoryless algorithms for the generalized k-server problem on uniform metrics
• Metrical service systems with multiple servers
• Weighted cache location problem with identical servers
• Calculating lower bounds for caching problems
• A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
• Randomized memoryless algorithms for the weighted and the generalized k-server problems
• scientific article; zbMATH DE number 1500546 (Why is no real title available?)
• The \(k\)-server problem
• scientific article; zbMATH DE number 1929943 (Why is no real title available?)
• On Hotelling's Weighing Problem
• Online chasing problems for regular polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887090)