Abstract
We propose a broadcasting algorithm for a faulty Cube-Connected-Cycles multiprocessor. The broadcasting algorithm delivers a message to all the nodes non-redundantly using a binomial tree. The traffic generated because of the recovery is guaranteed to be minimum.
This is a preview of subscription content, log in via an institution.
References
S. L. Johnsson and C.-T. Ho. Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. on Computers. 38, (9), Sept. 1989, 1249–1268.
D.S. Meliksetian and C.Y. R. Chen. Communication aspects of the cube-connected cycles. Proc. 1990 International Conference on Parallel Processing. 1579–580.
F.P. Preparata and J. Vuillemin. The cube-connected cycles, a versatile network for parallel computation. Communications of ACM. May 1981, 30–39.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J., Fernandez, E.B. (1992). Broadcasting in faulty Cube-Connected-Cycles with minimum recovery time. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_512
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_512
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive