Analysis of the Harmonic algorithm for three servers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003764" target="_blank" >RIV/00216208:11320/02:00003764 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/02:05020116
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Analysis of the Harmonic algorithm for three servers
Original language description
Harmonic is a randomized $k$-server algorithm that, at each step, given a request point $r$, chooses the server to be moved to $r$ with probability inversely proportional to the distance to $r$. We prove that Harmonic is 6-competitive for $k=3$.
Czech name
—
Czech description
—
Classification
Type
V<sub>x</sub> - Unclassified - Research report containing classified information
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Number of pages
10
Place of publication
Praha
Publisher/client name
MFF UK ITI series
Version
—