Broadcasting in faulty Cube-Connected-Cycles with minimum recovery time
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.
- S. L. Johnsson and C.-T. Ho. Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. on Computers. 38, (9), Sept. 1989, 1249–1268.Google Scholar
- D.S. Meliksetian and C.Y. R. Chen. Communication aspects of the cube-connected cycles. Proc. 1990 International Conference on Parallel Processing. 1579–580.Google Scholar
- F.P. Preparata and J. Vuillemin. The cube-connected cycles, a versatile network for parallel computation. Communications of ACM. May 1981, 30–39.Google Scholar