### The harmonic $\textit{k}-server$ algorithm is competitiveThe harmonic $\textit{k}-server$ algorithm is competitive

Access Restriction
Subscribed

 Author Bartal, Yair ♦ Grove, Eddie Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2000 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract The $\textit{k}-server$ problem is a generalization of the paging problems, and is the most studied problem in the area of competive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the $\textit{k}-server$ problem. We give a simple proof that the Harmonic k-server algorithm is competitive. The competitive ratio we prove is the best currently known fo the algorithm. The Harmonic algorithm is memoryless and time-efficient. This is the only such algorithm known to be competitive for the $\textit{k}-server$ problem. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2000-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 47 Issue Number 1 Page Count 15 Starting Page 1 Ending Page 15

#### Open content in new tab

Source: ACM Digital Library