| Author | H.L. de Cougny and M.S. Shephard |
|---|---|
| Title | Parallel Repartitioning based on Recursive Inertial Bisection |
| Year | 1998 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | - - |
| Pages | - - |
| Abstract | This paper presents a parallel dynamic version of the Recursive Inertial Bisection partitioner. It is driven by the Divide and Conquer paradigm, which is well suited for recursion-type algorithms. The sorting algorithm, the dominant step in the procedure, is based upon a parallel sample sort procedure. The presented partitioner is scalable with a time complexity of O((n/np)log(n/np)log(np)), where n is the number of entities to partition and np is the number of processors. |