More on weighted servers or FIFO is better than LRU

Leah Epstein; Csanád Imreh; Rob Van Stee

doi:10.1007/3-540-45687-2_21

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 proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
Editors	Krzysztof Diks, Wojciech Rytter, Wojciech Rytter
Publisher	Springer Verlag
Pages	257-268
Number of pages	12
ISBN (Print)	3540440402, 9783540440406
DOIs	https://doi.org/10.1007/3-540-45687-2_21
State	Published - 2002
Externally published	Yes
Event	27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland Duration: 26 Aug 2002 → 30 Aug 2002

Publication series

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

Conference

Conference	27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002
Country/Territory	Poland
City	Warsaw
Period	26/08/02 → 30/08/02

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: lea@idc.ac.il (L. Epstein), cimreh@amadea.inf.u-szeged.hu (C. Imreh), vanstee@uni-freiburg.de (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)

Access to Document

10.1007/3-540-45687-2_21

Cite this

Epstein, L., Imreh, C., & Van Stee, R. (2002). More on weighted servers or FIFO is better than LRU. In K. Diks, W. Rytter, & W. Rytter (Eds.), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings (pp. 257-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_21

Epstein, Leah ; Imreh, Csanád ; Van Stee, Rob. / More on weighted servers or FIFO is better than LRU. Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. editor / Krzysztof Diks ; Wojciech Rytter ; Wojciech Rytter. Springer Verlag, 2002. pp. 257-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{07421f1d74d64f39b3b356fed709b3b9,

title = "More on weighted servers or FIFO is better than LRU",

abstract = "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.",

author = "Leah Epstein and Csan{\'a}d Imreh and {Van Stee}, Rob",

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: lea@idc.ac.il (L. Epstein), cimreh@amadea.inf.u-szeged.hu (C. Imreh), vanstee@uni-freiburg.de (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: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 ; Conference date: 26-08-2002 Through 30-08-2002",

year = "2002",

doi = "10.1007/3-540-45687-2_21",

language = "English",

isbn = "3540440402",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "257--268",

editor = "Krzysztof Diks and Wojciech Rytter and Wojciech Rytter",

booktitle = "Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings",

address = "Germany",

}

Epstein, L, Imreh, C & Van Stee, R 2002, More on weighted servers or FIFO is better than LRU. in K Diks, W Rytter & W Rytter (eds), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2420, Springer Verlag, pp. 257-268, 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, Warsaw, Poland, 26/08/02. https://doi.org/10.1007/3-540-45687-2_21

More on weighted servers or FIFO is better than LRU. / Epstein, Leah; Imreh, Csanád; Van Stee, Rob.
Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. ed. / Krzysztof Diks; Wojciech Rytter; Wojciech Rytter. Springer Verlag, 2002. p. 257-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - More on weighted servers or FIFO is better than LRU

AU - Epstein, Leah

AU - Imreh, Csanád

AU - Van Stee, Rob

N1 - 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: lea@idc.ac.il (L. Epstein), cimreh@amadea.inf.u-szeged.hu (C. Imreh), vanstee@uni-freiburg.de (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.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84956975324&partnerID=8YFLogxK

U2 - 10.1007/3-540-45687-2_21

DO - 10.1007/3-540-45687-2_21

M3 - Conference contribution

AN - SCOPUS:84956975324

SN - 3540440402

SN - 9783540440406

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 257

EP - 268

BT - Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings

A2 - Diks, Krzysztof

A2 - Rytter, Wojciech

PB - Springer Verlag

T2 - 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002

Y2 - 26 August 2002 through 30 August 2002

ER -

Epstein L, Imreh C, Van Stee R. More on weighted servers or FIFO is better than LRU. In Diks K, Rytter W, Rytter W, editors, Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Springer Verlag. 2002. p. 257-268. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45687-2_21

More on weighted servers or FIFO is better than LRU

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this