Abstract
In this paper, we propose an efficient scheduling algorithm for expanding any divide-and-conquer (D&C) computation tree on k-dimensional mesh, hypercube, and perfect shuffle networks with p processors. Assume that it takes t n time steps to expand one node of the tree and t c time steps to transmit one datum or convey one node. For any D&C computation tree with N nodes, height h, and degree d (maximal number of children of any node), our algorithm requires at most (N/p+h)t n+ϕdht c time steps, where ϕ is O(log2 p) on a hypercube or perfect shuffle network and is \(O\left( {\sqrt[k]{p}} \right)\) on a n k−1x···xn 0 mesh network, where \(n_{k - 1} = \cdot \cdot \cdot = n_0 = \sqrt[k]{p}\). This algorithm is general in the sense that it does not know the values of N, h, and d, and the shape of the computation tree as well, a priori. Most importantly, we can easily obtain a linear speedup by nearly a factor of p, especially when N ≫ ph(1+ϕdt c /t n ).
This research was supported in part by the Defense Advanced Research Projects Agency, Information Science and Technology Office, under the title Research on Parallel Computing issued by DARPA/CMO under Contract MDA972-90-C-0035, ARPA Order No. 7330, in part by the National Science Foundation and the Defense Advanced Research Projects Agency under Cooperative Agreement NCR-8919038 with the Corporation for National Research Initiatives, and in part by the Office of Naval Research under Contract N00014-90-J-1939.
Preview
Unable to display preview. Download preview PDF.
References
E. A. Arnould, F. J. Bitz, E. C. Cooper, H. T. Kung, R. D. Sansom, and P. A. Steenkiste. The design of Nectar: a network backplane for heterogeneous multicomputer. In Third Intern. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS III), Boston, Massachusetts, April 1989.
H.E. Bal. The shared data-object model as a paradigm for programming distributed systems. PhD thesis, Vrije Universiteit, Amsterdam, Netherlands, 1989.
S. Borkar, R. Conn, G. Cox, S. Gleason, T. Gross, H. T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P. S. Tseng, J. Sutton, J. Urbanski, and J. Webb. Warp: An integrated solution to high-speed parallel computing. In Proceedings of Supercomputing '88, pages 330–339, Orlando, Florida, November 1988. IEEE Computer Society and ACM SIGARCH.
C. Ferguson and R.E. Korf. Distributed tree search and its application to alpha-beta prunning. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1988), pages 128–132, Saint Paul, August 1988.
R. Finkel and U. Manber. DIB — a Distributed Implementation of Backtracking. ACM Transactions on Programming Languages and Systems, 9(2):235–256, April 1987.
R.M. Haralick and G.L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial intelligence, 14(3):263–313, October 1980.
J. P. Hayes, T. Mudge, Q. F. Stout, S. Colley, and J. Palmer. A microprocessor-based hypercube supercomputer. IEEE MICRO, 6(5):6–17, October 1986.
C.A.R. Hoare. Quicksort. Computer Journal, 5:10–15, 1962.
V. Kumar and V. N. Rao. Parallel depth-first search, part I: implementation. International Journal of Parallel Programming, 16(6):479–499, 1987.
T. Leighton, M. Newman, A. G. Ranadc, and E. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 224–234, June 1989.
D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the ACM, 29(3):642–667, July 1982.
J.M. Ortega and R.G. Voigt. Solution of partial differential equations on vector and parallel computers. SIAM Review, 27(2):149–240, 1985.
C.G. Plaxton. Efficient Computation on Sparse Interconnection Networks. PhD thesis, Dept of CS, Stanford University, September 1989.
F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.
A. G. Ranade. Optimal speedup for backtrack search on a butterfly network. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 40–48, July 1991.
H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image processing, and GIS. Addison-Wesley, Reading, MA., 1990.
C. L. Seitz. The cosmic cube. Communications ACM, 28(1):22–33, January 1985.
W. Shu and L. V. Kale. A dynamic scheduling strategy for Chare-Kernel system. In Proceedings of Supercomputing '89, pages 389–398, New York, NY, November 1989.
I.-C. Wu and H.T. Kung. Communication complexity for parallel divide-and-conquer. To appear in 1991 Symposium on Foundations of Computer Science, October 1991.
Y. Zhang. Parallel Algorithms for Combinatorial search problems. PhD thesis, U.C. Berkeley, November 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, IC. (1991). Efficient parallel divide-and-conquer for a class of interconnection topologies. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_67
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive