This Article 
 Bibliographic References 
 Add to: 
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves
March 1996 (vol. 7 no. 3)
pp. 288-300

Abstract—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 (ORB) and a Median of Medians variant of ORB, ORB-MM. We present two results. First, ISP and ORB-MM are superior to ORB in rendering balanced workloads—because they are more fine-grained—and incur communication overheads that are comparable to ORB. 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] R.W. Hockney and J.W. Eastwood,Computer Simulation Using Particles, Adam Hilger, Philadelphia, 1998, pp. 6-23.
[2] J. Carrier, L. Greengard, and V. Rokhlin, "A fast adaptive multipole algorithm for particle simulations," SIAM J. Scientific Statistical Computing, Sept. 1988.
[3] M.J. Berger and J. Oliger, "Adaptive mesh refinement for hyperbolic partial differential equations," J. Computer Physics, vol. 53, no. 3, pp. 484-512, Mar. 1984.
[4] M.J. Berger and P. Colella, "Local adaptive mesh refinement for shock hydrodynamics," J. Computer Physics, vol. 82, no. 1, pp. 64-84, May 1989.
[5] C. Johnson, Numerical Solution of Partial Differential Equations by the Finite Element Method, Cambridge Univ. Press, 1987.
[6] A. Almgren, T. Buttke, and P. Colella, "A fast vortex method in three dimensions," Proc. 10th AIAA Computer Fluid Dynamics Conf.,Honolulu, pp. 446-455, June 1991.
[7] C.W. Ou and S. Ranka, “Parallel Remapping Algorithms for Adaptive Problems,” Proc. Frontiers '95, pp. 367-374, 1995.
[8] A. Sussman, J. Saltz, R. Das, S. Gupta, D. Mavriplis, and R. Ponnusamy, "PARTI primitives for unstructured and block structured problems," Computing Systems in Engineering, 1992.
[9] S.R. Kohn, "A parallel software infrastructure for dynamic block-irregular scientific calculations," PhD thesis, Univ. of California at San Diego, June 1995.
[10] A. Pothen, H. Simon, and K. Liou, "Partitioning Sparse Matrices with Eigenvectors of Graphs," SIAM J. Matrix Analysis and Application, vol. 11, pp. 430-352, July 1990.
[11] B. Hendrickson and R. Leland, "An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations," SIAM J. Scientific Computation, vol. 16, no. 2, Mar. 1995, pp. 452-469.
[12] N. Mansour and G.C. Fox, "Parallel physical optimization algorithms for allocating data to multicomputer nodes," J. Supercomputing," vol. 8, no. 1, pp. 53-80, Mar. 1994.
[13] M.J. Berger and S.H. Bokhari, "A partitioning strategy for nonuniform problems on multiprocessors," IEEE Trans. Computers, vol. 36, no. 5, pp. 570-580, May 1987.
[14] S. Baden,“Programming abstractions for dynamically partitioning and coordinating localized scientific calculations running on multiprocessors,” SIAM J. Scientific and Statistical Computation., vol. 12, 1991.
[15] J.P. Singh, C. Holt, J.L. Hennessy, and A. Gupta, "A parallel adaptive fast multipole method," Proc. Supercomputing 93, pp. 54-65, 1993.
[16] M.S. Warren and J.K. Salmon, "A parallel hashed oct-tree N-body algorithm," Proc. Supercomputing 93, pp. 12-21, 1993.
[17] C.-W. Ou, S. Ranka, and Geoffrey Fox, "Fast mapping and remapping algorithms for irregular and adaptive problems," 1993 ICPDS,Taipei, Taiwan Dec. 1993.
[18] J. Singh, "Parallel Hierarchical N-body Methods and Their Implications for Multiprocessors," PhD dissertation, EE Dept., Stanford University, Stanford, Calif., 1993.
[19] S.B. Baden and S.R. Kohn, "A comparison of load balancing strategies for particle methods running on MIMD multiprocessors," Proc. Fifth SIAM Conf. Parallel Processing for Scientific Computing,Houston, Mar 1991.
[20] S.H. Bokhari, T.W. Crockett, and D. M. Nicol, "Parametric binary dissection," Technical Report No. ICASE 93-39, NASA Langley Research Center, July 1993.
[21] D.W. Walker, "The hierarchical spatial decomposition of three-dimensional P-in-cell plasma simulations on MIMD distributed memory multiprocessors," Technical Report No. ORNL/TM-12071, Oak Ridge National Lab, July 1992.
[22] R.v. Hanxleden and L.R. Scott, "Load balancing on message passing architectures," J. Parallel and Distributed Computing, vol. 13, pp. 312-324, 1991.
[23] D.M. Nicol, "Rectilinear Partitioning of Irregular Data Parallel Computations," ICASE Report 91-55, NASA Contractor Report #187601, July 1991, J. Parallel and Distributed Computation, vol. 23, no. 2, pp. 119-134, Nov.1994.
[24] L.K. Platzman and J.J. Bartholdi III, "Spacefilling curves and the planar travelling salesman problem," J. ACM, vol. 36, no. 4, pp. 719-737, Oct. 1989.
[25] H. Abelson and A.A. diSessa, "Turtle geometry, the computer as a medium for exploring mathematics," MIT Press, 1984.
[26] A.J. Chorin, "Numerical study of slightly viscous flow," J. Fluid Mechanics, vol. 57, pp. 785-796, 1973.
[27] J.J. Monaghan, "Smoothed particle hydrodynamics," Ann Rev. Astronomy and Astrophysics," vol. 30, pp. 543-574, 1992.
[28] C.R. Anderson, "A method of local corrections for computing the velocity field due to a distribution of vortex blobs," J. Computing Physics, vol. 62, pp. 111-123, 1986.
[29] S.B. Baden, "Very large vortex calculations in two dimensions," Lecture Notes in Math.," C. Anderson and C. Greengard, eds., vol. 1,360, pp. 96-120, 1988.
[30] S.R. Kohn and S.B Baden, "Portable parallel programming of numerical problems under the LP AR system," J. Parallel and Distributed Computing," vol. 27, pp. 38-55, May. 1995.
[31] S.R. Kohn and S.B. Baden, "An implementation of the LPAR parallel programming model for scientific computations," Proc. Sixth SIAM Conf. Parallel Processing for Scientific Computing, pp. 759-766,Norfolk, Va., Mar. 1993.
[32] S.M. Figueira and S.B. Baden, "Performance analysis of parallel strategies for localized N-body solvers," Proc. Seventh SIAM Conf. Parallel Processing for Scientific Computing,San Francisco, Feb. 1995.
[33] D. Lenoski et al., “The Stanford DASH Multiprocessor,” Computer, pp. 63-79, Mar. 1992.
[34] R.S. Sandhu, D. Ferraiolo, and R. Kuhn, "The NIST Model for Role-Based Access Control: Towards A Unified Standard," 5th ACM Workshop on Role-Based Access Control, ACM Press, New York, 2000, pp. 47-60.
[35] S.R. Kohn and S.B. Baden, "A Robust Parallel Programming Model for Dynamic, Non-Uniform Scientific Computation," Proc. 1994 Scalable High Performance Computing Conf., pp. 509-517,Knoxville, Tenn., May 1994.
[36] J.R. Pilkington and S.B. Baden, "Partitioning with spacefilling curves," Univ. of Calif. at San Diego Dept. of Computer Science and Engineering, Technical Report No. CS94-349, 1994.
[37] S.R. Kohn and S.B. Baden, "Blobs: Visualization of particle methods on multiprocessors," Univ. of Calif. at San Diego, Technical Report No. CS92-241, May 1992.

Index Terms:
Dynamic load balancing, distributed memory parallel computers, spacefilling curve, non-uniform computations, irregular data partitioning, particle methods, performance.
John R. Pilkington, Scott B. Baden, "Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 288-300, March 1996, doi:10.1109/71.491582
Usage of this product signifies your acceptance of the Terms of Use.