Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

We discuss inverse spacefilling partitioning (ISP), a partitioning strategy for non-uniform scientific computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against orthogonal recursive bisection (ORE) and a median of medians variant of ORE, ORB-MM. We present two results. First, ISP and ORB-MM are superior to ORE in rendering balanced workloads-because they are more fine-grained-and incur communication overheads that are comparable to ORE. Second, ISP is more attractive than ORB-MM from a software engineering standpoint because it avoids elaborate bookkeeping. Whereas ISP partitionings can be described succinctly as logically contiguous segments of the line, ORB-MM's partitionings are inherently unstructured. We describe the general d-dimensional ISP algorithm and report empirical results with two- and three-dimensional, non-hierarchical particle methods.

[1]  Reinhard von Hanxleden,et al.  Load Balancing on Message Passing Architectures , 1991, J. Parallel Distributed Comput..

[2]  D. Nicol,et al.  Parametric binary dissection , 1993 .

[3]  Scott B. Baden,et al.  Very large vortex calculations in two dimensions , 1988 .

[4]  Scott B. Baden,et al.  A Comparison of Load Balancing Strategies for Particle Methods Running on MIMD Multiprocessors , 1991, PPSC.

[5]  P. Colella,et al.  A Fast Adaptive Vortex Method in Three Dimensions , 1994 .

[6]  C. R. Anderson.  A method of local corrections for computing the velocity field due to a distribution of vortex blobs , 1986 .

[7]  Geoffrey C. Fox,et al.  Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems , 1993 .

[8]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[9]  Scott B. Baden,et al.  A robust parallel programming model for dynamic non-uniform scientific computations , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[10]  Sanjay Ranka,et al.  Parallel remapping algorithms for adaptive problems , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[11]  J. CARRIERt,et al.  A FAST ADAPTIVE MULTIPOLE ALGORITHM FOR PARTICLE SIMULATIONS * , 2022 .

[12]  John J. Bartholdi,et al.  Spacefilling curves and the planar travelling salesman problem , 1989, JACM.

[13]  Joel H. Saltz,et al.  PARTI primitives for unstructured and block structured problems , 1992 .

[14]  J. Monaghan.  Smoothed particle hydrodynamics , 2005 .

[15]  Scott B. Baden,et al.  An Implementation of the LPAR Parallel Programming Model for Scientific Computations , 1993, PPSC.

[16]  Scott B. Baden,et al.  Portable Parallel Programming of Numerical Problems under the LPAR System , 1995, J. Parallel Distributed Comput..

[17]  Michael S. Warren,et al.  A parallel hashed oct-tree N-body algorithm , 1993, Supercomputing '93. Proceedings.

[18]  Phillip Colella,et al.  A fast vortex method in three dimensions , 1991 .

[19]  M. Berger,et al.  Adaptive mesh refinement for hyperbolic partial differential equations , 1982 .

[20]  Scott B. Baden,et al.  A parallel software infrastructure for dynamic block-irregular scientific calculations , 1995 .

[21]  Jaswinder Pal Singh,et al.  Hierarchical n-body methods and their implications for multiprocessors , 1993 .

[22]  Scott B. Baden,et al.  Programming Abstractions for Dynamically Partitioning and Coordinating Localized Scientific Calculations Running on Multiprocessors , 1991, SIAM J. Sci. Comput..

[23]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[24]  Harold Abelson,et al.  Turtle geometry : the computer as a medium for exploring mathematics , 1983 .

[25]  R W Hockney,et al.  Computer Simulation Using Particles , 1966 .

[26]  David M. Nicol,et al.  Rectilinear Partitioning of Irregular Data Parallel Computations , 1994, J. Parallel Distributed Comput..

[27]  Anoop Gupta,et al.  A parallel adaptive fast multipole method , 1993, Supercomputing '93. Proceedings.

[28]  Anoop Gupta,et al.  The Stanford Dash multiprocessor , 1992, Computer.

[29]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[30]  Claes Johnson.  Numerical solution of partial differential equations by the finite element method , 1988 .

[31]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[32]  Scott B. Baden,et al.  Performance Analysis of Parallel Strategies for Localized N-Body Solvers , 1995, PPSC.

[33]  P. Colella,et al.  Local adaptive mesh refinement for shock hydrodynamics , 1989 .

[34]  James R. Larus,et al.  Application-specific protocols for user-level shared memory , 1994, Proceedings of Supercomputing '94.

[35]  A. Chorin.  Numerical study of slightly viscous flow , 1973, Journal of Fluid Mechanics.

[36]  D. W. Walker.  The hierarchical spatial decomposition of three-dimensional particle- in-cell plasma simulations on MIMD distributed memory multiprocessors , 1992 .

[37]  C. Ozturan,et al.  Adaptive methods and rectangular partitioning problem , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..