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

Aggarwal, Alok
Rangan, C. Pandu

dblp
dblp



BibTeX cite key*:

San99d

Title, Booktitle

Title*:

Asynchronous Random Polling Dynamic Load Balancing

Booktitle*:

Algorithms and computation : 10th International Symposium, ISAAC'99

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Chennai, India

Language:

English

Event Date*
(no longer used):

December, 16-18

Organization:


Event Start Date:

16 December 1999

Event End Date:

18 December 1999

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1741

Number:


Month:

December

Pages:

37-48

Year*:

1999

VG Wort Pages:


ISBN/ISSN:

3-540-66916-7

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Many applications in parallel processing have to traverse large,
implicitly defined trees with irregular shape. The receiver initiated
load balancing algorithm \emph{random polling} has long been known to
be very efficient for these problems in practice. For any
$\epsilon>0$, we prove that its parallel execution time is at most
$(1+\epsilon)\Tseq/\proc + \Oh{\Tatomic + h(\frac{1}{\epsilon} +
\Trouting + \Tsplit)}$ with high probability, where $\Trouting$,
$\Tsplit$ and $\Tatomic$ bound the time for sending a message,
splitting a subproblem and finishing a small unsplittable subproblem
respectively. The \emph{maximum splitting depth} $h$ is related to the
depth of the computation tree. Previous work did not prove efficiency
close to one and used less accurate models. In particular, our machine
model allows asynchronous communication with nonconstant message
delays and does not assume that communication takes place in
rounds. This model is compatible with the LogP model.

Keywords:

adaptive granularity control, asynchronous algorithm, hypercubic and mesh network, parallel backtrack search, parallel random permutation, randomized load balancing algorithm

HyperLinks / References / URLs:

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



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{San99d,
AUTHOR = {Sanders, Peter},
EDITOR = {Aggarwal, Alok and Rangan, C. Pandu},
TITLE = {Asynchronous Random Polling Dynamic Load Balancing},
BOOKTITLE = {Algorithms and computation : 10th International Symposium, ISAAC'99},
PUBLISHER = {Springer},
YEAR = {1999},
VOLUME = {1741},
PAGES = {37--48},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Chennai, India},
MONTH = {December},
ISBN = {3-540-66916-7},
}


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
02/23/2000 06:02:45 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Anja Becker
Anja Becker
Peter Sanders
Edit Dates
25.09.2006 11:18:39
07.04.2000 10:06:25
29.03.2000 16:38:13
23/02/2000 18:02:45
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section