The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 151-162
H.T. Kung , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
I.-C. Wu , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
ABSTRACT
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.
INDEX TERMS
lower bounds, parallel divide-and-conquer, parallel computation cost, communication cost, parallel system, cross nodes, scheduling algorithm
CITATION
H.T. Kung, I.-C. Wu, "Communication complexity for parallel divide-and-conquer", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 151-162, 1991, doi:10.1109/SFCS.1991.185364
90 ms
(Ver 3.3 (11022016))