Communication complexity for parallel divide-and-conquer

The relationship between parallel computation cost and communication cost for performing divide-and-conquer (D&C) computations on a parallel system of p processors is studied. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel system may expand, whereas the communication cost is the total number of cross nodes (nodes generated by one processor but expanded by another processor). A scheduling algorithm is proposed, and lower bounds on the communication cost are derived. The proposed scheduling algorithm is optimal with respect to the communication cost, since the parallel computation cost of the algorithm is near optimal.<<ETX>>

[1]  J. Ortega,et al.  Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[2]  Henri E. Bal.  The shared data-object model as a paradigm for programming distributed systems , 1989 .

[3]  H. T. Kung,et al.  The design of nectar: a network backplane for heterogeneous multicomputers , 1989, ASPLOS III.

[4]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[5]  Laxmikant V. Kalé,et al.  A dynamic scheduling strategy for the Chare-Kernel system , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[6]  Udi Manber,et al.  DIB—a distributed implementation of backtracking , 1987, TOPL.

[7]  I-Chen Wu,et al.  Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies , 1991, ISA.

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  Michael C. Loui,et al.  Communication and synchronization in parallel computation , 1988 .

[10]  R. Karp,et al.  Parallel Algorithms for Combinatorial Search Problems , 1989 .

[11]  Christos H. Papadimitriou,et al.  A Communication-Time Tradeoff , 1987, SIAM J. Comput..

[12]  Richard E. Korf,et al.  Distributed Tree Search and Its Application to Alpha-Beta Pruning , 1988, AAAI.

[13]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..