Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Epstein, Leah
Imreh, Csanád
van Stee, Rob

dblp
dblp
dblp

Not MPG Author(s):

Epstein, Leah
van Stee, Rob

Editor(s):

Diks, Krzysztof
Rytter, Wojciech

dblp
dblp

Not MPII Editor(s):

Diks, Krzysztof
Rytter, Wojciech

BibTeX cite key*:

Imreh2001

Title, Booktitle

Title*:

More on weighted servers or FIFO is better than LRU

Booktitle*:

Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002

Event, URLs

URL of the conference:

http://mfcs.mimuw.edu.pl:9080/

URL for downloading the paper:


Event Address*:

Warsawa-Otwock, Poland

Language:

English

Event Date*
(no longer used):

-- August, 26-August 30

Organization:

European Association for theoretical Computer Science

Event Start Date:

26 August 2002

Event End Date:

30 August 2002

Publisher

Name*:

Springer

URL:

http://www.springer-ny.com/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

August

Number:

2420

Month:

August

Pages:

257-268

Year*:

2002

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) 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.

Keywords:

Online Algorithms



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{Imreh2001,
AUTHOR = {Epstein, Leah and Imreh, Csan{\'a}d and van Stee, Rob},
EDITOR = {Diks, Krzysztof and Rytter, Wojciech},
TITLE = {More on weighted servers or FIFO is better than LRU},
BOOKTITLE = {Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002},
PUBLISHER = {Springer},
YEAR = {2002},
ORGANIZATION = {European Association for theoretical Computer Science},
NUMBER = {2420},
VOLUME = {August},
PAGES = {257--268},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Warsawa-Otwock, Poland},
MONTH = {August},
}


Entry last modified by Christine Kiesel, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Csanad Imreh
Created
09/17/2002 02:29:09 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Christine Kiesel
Christine Kiesel
Anja Becker
Uwe Brahm
Uwe Brahm
Edit Dates
28.08.2003 15:56:34
28.08.2003 15:40:51
20.06.2003 15:43:18
06/09/2003 11:24:40 PM
09.05.2003 12:38:39
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section