Load Balancing of Irregular Parallel Divide-and-Conquer Algorithms in Group-SPMD Programming Environments
Mattias V. Eriksson, Christoph W. Keßler, Mikhail Chalabine · 2006
We study strategies for local load balancing of irregular parallel divide-andconquer algorithms such as Quicksort and Quickhull in SPMD-parallel environments such as MPI and Fork that allow to exploit nested parallelism by dynamic group splitting.