Efficient load balancing for wide-area divide-and-conquer applications

@inproceedings{Nieuwpoort2001EfficientLB,
  title={Efficient load balancing for wide-area divide-and-conquer applications},
  author={Rob van Nieuwpoort and Thilo Kielmann and Henri E. Bal},
  booktitle={PPOPP},
  year={2001}
}
Divide-and-conquer programs are easily parallelized by letting the programmer annotate potential parallelism in the form of spawn and sync constructs. To achieve efficient program execution, the generated work load has to be balanced evenly among the available CPUs. For single cluster systems, Random Stealing (RS) is known to achieve optimal load balancing. However, RS is inefficient when applied to hierarchical wide-area systems where multiple clusters are connected via wide-area networks… CONTINUE READING
Highly Cited
This paper has 154 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

155 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 155 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…