IEEE Transactions on Computers
A recursively scalable network VLSI implementation
Future Generation Computer Systems
An optimized broadcasting technique for WK-Recursive topologies
Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Topological properties of WK-recursive networks
Journal of Parallel and Distributed Computing
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Generalized Ring Interconnection Networks
Proceedings of the 8th International Symposium on Parallel Processing
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The WK-recursive networks own two structural advantages: expansibility and equal degree. A network is expansible if no changes to node configuration and link connection are necessary when it is expanded, and of equal degree if its nodes have the same degree no matter what the size is. However, the number of nodes contained in a WK-recursive network is restricted to dt, where d 1 is the size of the basic building block and t驴 1 is the level of expansion. The incomplete WK-recursive networks, which were proposed to relieve this restriction, are allowed to contain an arbitrary number of basic building blocks, while preserving the advantages of the WK-recursive networks.Designing shortest-path routing algorithms for incomplete networks is in general more difficult than for complete networks. The reason is that most incomplete networks lack a unified representation. One of the contributions of this paper is to demonstrate a useful representation, i.e., the multistage graph representation, for the incomplete WK-recursive networks. On the basis of it, a shortest-path routing algorithm is then proposed. With O(d·t) time preprocessing, this algorithm takes O(t) time for each intermediate node to determine the next node along the shortest path.