Competitive algorithms for the weighted server problem

DOI10.1016/0304-3975(94)90154-6zbMath0938.68956OpenAlexW2163658180MaRDI QIDQ1331957

Moty Rickling, Amos Fiat

Publication date: 21 June 2000

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90154-6

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

The weighted 2-server problem ⋮ The CNN problem and other \(k\)-server variants ⋮ The orthogonal CNN problem ⋮ Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ More on weighted servers or FIFO is better than LRU. ⋮ Calculating lower bounds for caching problems ⋮ The optimal structure of algorithms for \(\alpha\)-paging ⋮ Metrical service systems with multiple servers ⋮ Paging with request sets ⋮ Memoryless algorithms for the generalized k-server problem on uniform metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Shortest paths without a map
• Competitive snoopy caching
• On the power of randomization in on-line algorithms
• Competitive \(k\)-server algorithms
• Random walks on weighted graphs and applications to on-line algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive paging algorithms
• Competitive Algorithms for Layered Graph Traversal
• Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
• An optimal on-line algorithm for metrical task system

This page was built for publication: Competitive algorithms for the weighted server problem