Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

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

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Sanders, Peter

dblp



BibTeX cite key*:

Sanders2002i

Title

Title*:

Reconciling simplicity and realism in parallel disk models

Journal

Journal Title*:

Parallel Computing

Journal's URL:

http://www.elsevier.com/locate/issn/01678191

Download URL
for the article:

http://www.mpi-sb.mpg.de/~sanders/papers/index.html

Language:

English

Publisher

Publisher's
Name:

North-Holland

Publisher's URL:


Publisher's
Address:

Amsterdam, The Netherlands

ISSN:

0167-8191

Vol, No, pp, Date

Volume*:

28

Number:

5

Publishing Date:

2002

Pages*:

705-723

Number of
VG Pages:

45

Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

For the design and analysis of algorithms that process huge data sets, a
machine model is needed that handles parallel disks. There seems to be
a dilemma between simple and flexible use of such a model and accurate
modelling of details of the hardware. This paper explains how many
aspects of this problem can be resolved. The programming model
implements one large logical disk allowing concurrent access to
arbitrary sets of variable size blocks. This model can
be implemented efficienctly on multiple
independent disks even if zones with different speed,
communication bottlenecks
and failed disks are allowed. These results not only provide useful
algorithmic tools but also imply a theoretical justification for
studying external memory algorithms using simple abstract models.

The algorithmic approach is random redundant placement of data and
optimal scheduling of accesses. The analysis generalizes a previous
analysis for simple abstract external memory models in several ways
(Higher efficiency, variable block sizes, more detailed disk model).
As a side effect, an apparently new Chernoff-Hoeffding bound for sums of
weighted 0-1 random variables is derived.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


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, VG Wort


BibTeX Entry:

@ARTICLE{Sanders2002i,
AUTHOR = {Sanders, Peter},
TITLE = {Reconciling simplicity and realism in parallel disk models},
JOURNAL = {Parallel Computing},
PUBLISHER = {North-Holland},
YEAR = {2002},
NUMBER = {5},
VOLUME = {28},
PAGES = {705--723},
ADDRESS = {Amsterdam, The Netherlands},
ISBN = {0167-8191},
}


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)
Peter Sanders
Created
01/30/2003 06:50:35 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Christine Kiesel
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel
Edit Dates
30.05.2005 15:53:19
02/14/2005 08:15:28 PM
02/14/2005 08:15:00 PM
08.09.2003 17:54:29
27.08.2003 16:24:47
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section