A simple analysis of the harmonic algorithm for two servers

DOI10.1016/S0020-0190(00)00070-3zbMATH Open1339.68341OpenAlexW2057947229MaRDI QIDQ294802FDOQ294802

Jiří Sgall, Marek Chrobak

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000703?np=y

Recommendations

• HARMONIC is 3-competitive for two servers
• STACS 2004
• scientific article; zbMATH DE number 1962818
• The harmonic k -server algorithm is competitive
• A competitive 2-server algorithm

zbMATH Keywords

randomizationonline algorithmsanalysis of algorithmstheory of computation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Competitive algorithms for server problems
• HARMONIC is 3-competitive for two servers
• On the k -server conjecture
• The harmonic k -server algorithm is competitive

Cited In (4)

• Title not available (Why is that?)
• The harmonic k -server algorithm is competitive
• HARMONIC is 3-competitive for two servers
• More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.

This page was built for publication: A simple analysis of the harmonic algorithm for two servers

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