de.mpg.escidoc.pubman.appbase.FacesBean
English
 
HelpDisclaimerContact usLogin
  Advanced SearchBrowse

Item

  • Please note that a newer version of this item is in progress.
  More on weighted servers or FIFO is better than LRU

Epstein, L., Imreh, C., & van Stee, R. (2002). More on weighted servers or FIFO is better than LRU. In Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002 (pp. 257-268). Berlin, Germany: Springer.

Item is

Basic

show hide
Bookmark this item: http://pubman.mpdl.mpg.de/pubman/item/escidoc:1330384:2
Latest Version: http://pubman.mpdl.mpg.de/pubman/item/escidoc:1330384:3
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Epstein, Leah, Author
Imreh, Csanád1, Author
van Stee, Rob2, Author              
Diks, Krzysztof, Editor
Rytter, Wojciech, Editor
Affiliations:
1Max Planck Society, escidoc:persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, escidoc:24019              

Content

show
hide
Free keywords: -
 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. %Furthermore, our algorithm is trackless, %which means that it is restricted from storing %explicitly points from the metric space. 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.

Details

show
hide
Language(s): eng - English
 Dates: 2003-08-282002
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: eDoc: 202083
Other: Local-ID: C1256428004B93B8-07DC6BF42FF3A0C6C1256C3700449651-Imreh2001
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Warsawa-Otwock, Poland
Start-/End Date: 2002-08-26 -

Legal Case

show

Source 1

show
hide
Title: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002
Source Genre: Proceedings
 Creator(s):
-
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 257 - 268 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
-
Affiliations:
-
Publ. Info: -
Pages: - Volume / Issue: 2420 Sequence Number: - Start / End Page: - Identifier: -