Name
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 |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/ISPAN.1996.509013 | Journal of Parallel and Distributed Computing |
Keywords | DocType | Volume |
broadcasting trees,incomplete wk-recursive network,incomplete networks,multiprocessor interconnection networks,incomplete wk-recursive networks,broadcasting algorithm,broadcasting,wk-recursive networks,proposed broadcasting algorithm,communication complexity,rigorous restriction,broadcasting tree,incomplete network,extensive experiment,wk-recursive network,graph theory,high percentage,message complexity,shortest path,tree graphs,hypercubes | Conference | 57 |
Issue | ISSN | ISBN |
3 | 1087-4089 | 0-8186-7460-1 |
Citations | PageRank | References |
10 | 0.74 | 30 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-Yang Su | 1 | 362 | 22.26 |
| Gen-Huey Chen | 2 | 979 | 89.32 |
| Dyi-Rong Duh | 3 | 339 | 26.92 |