Title :
Broadcasting on incomplete WK-recursive networks
Author :
Su, Min-Yang ; Chen, Gen-Huey ; Duh, Dyi-Rong
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Abstract :
The WK-recursive networks which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, broadcasting on the incomplete WK-recursive networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity. Besides, experimental results show that the heights of the broadcasting trees do not exceed the diameters, and a high percentage of the nodes can receive the message from the source node via the shortest paths
Keywords :
communication complexity; graph theory; multiprocessor interconnection networks; WK-recursive networks; broadcasting; broadcasting algorithm; broadcasting trees; incomplete networks; message complexity; Broadcasting; Educational institutions; Hypercubes; Joining processes; Tree graphs;
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on
Conference_Location :
Beijing
Print_ISBN :
0-8186-7460-1
DOI :
10.1109/ISPAN.1996.509013
