# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Asynchronous Random Polling Dynamic Load Balancing

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Sanders, P. (1999). Asynchronous Random Polling Dynamic Load Balancing. In A. Aggarwal,
& C. P. Rangan (*Algorithms and computation: 10th
International Symposium, ISAAC'99* (pp. 37-48). Berlin, Germany: Springer.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-35A5-7

##### 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.