We consider a generalized two-server problem on the uniform space in which servers have different costs. Previous work focused on the case where the ratio between these costs was very large. We give results for varying ratios. For ratios below 2.2, we present a best possible algorithm which is trackless. We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio. The results are extended for the case where we have two sets of servers with different costs.
Bibliographical noteFunding Information:
A preliminary version of this paper appeared in Proc. of the 27th M athematical Foundations of Computer Science (M FCS 2002), LNCS 2420, pp. 257–268. ∗Corresponding author. E-mail addresses: email@example.com (L. Epstein), firstname.lastname@example.org (C. Imreh), email@example.com (R. van Stee). 1Research supported in part by the Israel Science Foundation (Grant No. 250/01). 2Most part of this work was done while the author was postdoc at MPI fu@r Informatik. Research supported by Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM -FT) and by the Hungarian National Foundation for ScientiCc Research, Grant TO30074. 3Work supported by the Deutsche Forschungsgemeinschaft, Project AL 464/3-1, and by the European Community, Projects APPOL and APPOL II.
- k-Server problem
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)