HARMONIC is 3-competitive for two servers

DOI10.1016/0304-3975(92)90007-3zbMath0761.68021OpenAlexW2003449354MaRDI QIDQ1193886

Marek Chrobak, Lawrence L. Larmore

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90007-3

zbMATH Keywords

competitiveness\(k\)-server problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

A simple analysis of the harmonic algorithm for two servers ⋮ The \(k\)-server problem ⋮ More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. ⋮ Trackless online algorithms for the server problem ⋮ Limited bookmark randomized online algorithms for the paging problem

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive algorithms for server problems
• A New Approach to the Server Problem

This page was built for publication: HARMONIC is 3-competitive for two servers