Abstract
Based upon hypercube multiprocessor systems, this paper analyses in detail the communication performance under the background of the greedy multicast algorithm GMA. The mean delay time of a message both at a node and in the system under multicasting is derived. For the sake of contrast, the delay of multicast message is compared with that of multiple one-to-one messages.
Similar content being viewed by others
References
S. Abraham and K. Padmanabhan, Performance of the direct binaryn-cube network for multiprocessors.IEEE Trans. on Computers, 1989, (7), pp. 1000–1011.
A. Beguelin and D. J. Vasicak, Communication between nodes of a hypercube. Hypercube Multiprocessors 1987 Proceedings. (Michael T. Heath ed). SIAM, 1987.
T. H. Dunigan, Hypercube performance. Hypercube Multiprocessors 1987 Proceedings (Michael. T. Heath ed.), SIAM, 1987.
Y. Lan, A. H. Esfahanian and L. M. Ni, Multicast in hypercube multiprocessors.Journal of Parallel and Distributed Computing, 1990, 8 (1), pp. 30–41.
L. M. Ni, C. T. King and Prins, Parallel algroithm design considerations for hypercube multiprocessors, Proc. of the Int'l Conf. on Parallel Processing, 1987, pp. 717–720.
M. J. Quinn, Designing Efficient Algorithms for Parallel Computers. McGraw-Hill, Inc. 1987.
Y. Saad and M. H. Schultz, Topological properties of hypercubes. Res. Report YALEU/DCS/RR-389, Dept. of Computer Science, Yale University, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xu, H., Li, X. & Nau, R.W. Performance of multicast communication on hypercubes. J. of Compt. Sci. & Technol. 8, 374–378 (1993). https://doi.org/10.1007/BF02939546
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939546