1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96) Broadcasting on Incomplete WK-Recursive Networks Beijing, CHINA June 12-June 14 ISBN: 0-8186-7460-1
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, extensive experiments are made to evaluate its performance. 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 path.
Index Terms:
broadcasting algorithms, graph-theoretic interconnection network, incomplete WK-recursive networks, WK-recursive networks
Citation:
Min-Yang Su, Gen-Huey Chen, Dyi-Rong Duh, "Broadcasting on Incomplete WK-Recursive Networks," ispan, pp.375, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||