A deadlock free shortest path routing algorithm for WK-recursive meshes

Authors:
Mostafa Rezazad;M. Hoseiny Farahabady;Hamid Sarbazi-Azad
Affiliations:
Sharif University of Technology, Terhan, Iran and IPM School of Computer Science, Tehrn, Iran;Sharif University of Technology, Terhan, Iran;Sharif University of Technology, Terhan, Iran and IPM School of Computer Science, Tehrn, Iran
Venue:
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Year:
2008

Citing 6
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
A recursively scalable network VLSI implementation

Future Generation Computer Systems
An adaptive routing algorithm for WK-recursive topologies

Computing
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
The WK-Recursive Pyramid: An Efficient Network Topology

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
The RTCC-pyramid: A Versatile Pyramid network

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate an efficient deadlock-free shortest path routing algorithm for WK-recursive mesh networks which has been shown that possess several advantages like suitable to be manufactured by VLSI technology and easy to be expanded. It will be shown that the proposed algorithm requires O(√n) routing steps (where N is the network size) to route the entire network by exploiting either the self-routing or second order routing scheme.