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):

Sanders, Peter

dblp



Editor(s):

Van Emde Boas, Peter
Pokorný, Jaroslav
Bieliková, Mária
Stuller, Július

dblp
dblp
dblp
dblp



BibTeX cite key*:

Sanders2004a

Title, Booktitle

Title*:

Algorithms for Scalable Storage Servers

Booktitle*:

SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science

Event, URLs

URL of the conference:

http://www.cs.cas.cz/sofsem/04/design/

URL for downloading the paper:

http://www.springerlink.com/app/home/contribution.asp?wasp=e2eygx3dwncqqld02g0v&referrer=parent&backto=issue,8,32;journal,443,1919;linkingpublicationresults,1:105633,1

Event Address*:

Merín, Czech Republic

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

24 January 2004

Event End Date:

30 January 2004

Publisher

Name*:

Springer

URL:

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

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

2932

Number:


Month:

January

Pages:

82-101

Year*:

2004

VG Wort Pages:

45

ISBN/ISSN:

3-540-20779-1

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We survey a set of algorithmic techniques that make it possible
to build a high performance storage server from a network
of cheap components. Such a storage server offers a very
simple programming model. To the clients it looks like
a single very large disk that can handle many requests
in parallel with minimal interference between the requests.
The algorithms use randomization, redundant storage, and
sophisticated scheduling strategies to achieve this goal.
The focus is on algorithmic techniques and open questions.
The paper summarizes several previous papers and presents
a new strategy for handling heterogeneous disks.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{Sanders2004a,
AUTHOR = {Sanders, Peter},
EDITOR = {Van Emde Boas, Peter and Pokorný, Jaroslav and Bielikov{\'a}, M{\'a}ria and Stuller, Július},
TITLE = {Algorithms for Scalable Storage Servers},
BOOKTITLE = {SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {2932},
PAGES = {82--101},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Merín, Czech Republic},
MONTH = {January},
ISBN = {3-540-20779-1},
}


Entry last modified by Christine Kiesel, 04/26/2005
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)
Peter Sanders
Created
02/15/2005 02:26:27 PM
Revisions
2.
1.
0.

Editor(s)
Christine Kiesel
Christine Kiesel
Peter Sanders

Edit Dates
26.04.2005 16:22:30
11.04.2005 15:43:29
02/15/2005 02:26:27 PM

Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section