Abstract
In this work we consider tree-based interconnects where the processing nodes are confined to the leaves of the tree. These types of interconnects include fat tree networks. We present and analyze algorithms for collective communications problems that include broadcasting, scattering/gathering, multinode broadcasting and total exchange.
This research was supported in part through grants from NSERC and the University of Victoria.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D.P. Bertsekas, et. al. “Optimal communication algorithms for hypercubes,” J. Parallel Distrib. Comput., Vol. 11, pp. 263–275, 1991.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewoods Cliffs, N.J.: Prentice-Hall, 1989.
S. N. Bhatt, et. al. “Scattering and gathering messages in networks of processors,” IEEE Trans. Comput., Vol. 42, No. 8, pp. 938–949, Aug. 1993.
V. V. Dimakopoulos and N. J. Dimopoulos, “Leaf communications in complete trees,” Technical Report ECE-95-6, University of Victoria, Oct. 1995.
R. Feldmann, et. al. “Optimal algorithms for dissemination of information in generalized communication modes,” in Proc. 4th PARLE, Parallel Architectures and Languages Europe, Paris, France, June 1992, pp. 115–130.
P. Fraigniaud and E. Lazard, “Methods and problems of communication in usual networks,” Discrete Appl. Math., Vol. 53, pp. 79–133, 1994.
S. M. Hedetniemi, et. al. “A survey of gossiping and broadcasting in communication networks,” Networks, Vol. 18, pp. 319–349, 1988.
S. L. Johnsson and C.-T. Ho, “Optimum broadcasting and personalized communication in hypercubes,” IEEE Trans. Comput., Vol. 38, pp. 1249–1268, 1989.
C. E. Leiserson, “Fat-trees: universal networks for hardware-efficient supercomputing,” IEEE Trans. Comput., Vol. C-34, No. 10, pp. 892–901, Oct. 1985.
C. E. Leiserson and et al, “The network architecture of the Connection Machine CM-5,” in Proc. 4th ACM Symp. Parall. Algor. Arch., June 1992, pp. 272–285.
Y. Saad and M. H. Schultz, “Data communications in hypercubes,” J. Parallel Distrib. Comput., Vol. 6, pp. 115–135, 1989.
Y. Saad and M. H. Schultz, “Data communications in parallel architectures,” Parallel Comput., Vol. 11, pp. 131–150, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimakopoulos, V.V., Dimopoulos, N.J. (1996). Leaf communications in complete trees. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_45
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive