Multidimensional binary partitions : distributed data structures for spatial partitioning

A multidimensional binary partition (MBP) is a data structure determined by a set of points in n -dimensional space. On certain parallel architectures, this data structure can be easily distributed across the processing nodes of the machine and can provide a natural technique for load balancing and partitioning of application problems that depend on a distribution of dynamically changing points in multidimensional space. This paper describes parallel algorithms for generating and using MBPs on a hypercube parallel machine. It is also shown how these distributed data structures allow efficient parallel searches of the data set. The performance of an implementation of these algorithms on an NCUBE hypercube is presented.

[1]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2]  Michael T. Heath.  Hypercube multiprocessors 1986 , 1986 .

[3]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[4]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[5]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[6]  David W. Krumme,et al.  Fixed Hypercube Embedding , 1987, Inf. Process. Lett..

[7]  D.A. Carlson,et al.  Assigning modules to processors in linear arrays and rings , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[8]  Jacob A. Abraham,et al.  Load Balancing in Distributed Systems , 1982, IEEE Transactions on Software Engineering.

[9]  William Gropp,et al.  A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation , 1985, PP.

[10]  Camille C. Price,et al.  The assignment of computational tasks among processors in a distributed system , 1981, AFIPS '81.

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

[12]  Jay P. Boris,et al.  A vectorized near neighbors algorithm of order N using a monotonic logical grid , 1986 .

[13]  Stephen M. Omohundro,et al.  Efficient Algorithms with Neural Network Behavior , 1987, Complex Syst..

[14]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[15]  S. B. Baden.  DYNAMIC LOAD BALANCING OF A VORTEX CALCULATION RUNNING ON MULTIPROCESSORS , 1986 .