Title :
Broadcasting on uni-directional hypercubes
Author :
Huang, Huang-Ming ; Yang, Chang-Biau
Author_Institution :
Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
Abstract :
In this paper, we solve the broadcasting problem for the even dimensional uni-directional hypercube (UHC). In the constant evaluation model, the complexity of one of our all-port broadcasting trees, is n+1, and it is optimal. Whereas the best one of our one-port broadcasting trees needs 4/3(n-n mode 6)+3/2(n mod 6) steps. These algorithms can be extended to solve the odd dimensional case. We also propose an all-port fault-tolerant broadcasting tree whose height is 3/2n+n mode 4/2
Keywords :
computational complexity; fault tolerant computing; hypercube networks; all-port broadcasting trees; broadcasting; complexity; constant evaluation model; fault-tolerant broadcasting tree; unidirectional hypercubes; Broadcasting; Costs; Fault tolerance; Hypercubes; Mathematics; Tree graphs;
Conference_Titel :
Parallel and Distributed Systems, 1994. International Conference on
Conference_Location :
Hsinchu
Print_ISBN :
0-8186-6555-6
DOI :
10.1109/ICPADS.1994.590063
