More on weighted servers or FIFO is better than LRU

Leah Epstein, Csanád Imreh, Rob Van Stee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We consider a generalized 2-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 an optimal algorithm which is trackless. We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the optimal 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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
EditorsKrzysztof Diks, Wojciech Rytter, Wojciech Rytter
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540440402, 9783540440406
StatePublished - 2002
Externally publishedYes
Event27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland
Duration: 26 Aug 200230 Aug 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002

Bibliographical note

Funding 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: (L. Epstein), (C. Imreh), (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.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'More on weighted servers or FIFO is better than LRU'. Together they form a unique fingerprint.

Cite this