IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Efficient and balanced adaptive routing in two-dimensional meshes
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Analysis of Buffer Design for Adaptive Routing in Direct Networks
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A Performance Model of Adaptive Routing in k-Ary n-Cubes with Matrix-Transpose Traffic
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Dynamic channel selection: an efficient strategy for balancing traffic in meshes
International Journal of Computational Science and Engineering
An accurate mathematical performance model of adaptive routing in the star graph
Future Generation Computer Systems
Balancing traffic in meshes by dynamic channel selection
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Complement routing: A methodology to design reliable routing algorithm for Network on Chips
Microprocessors & Microsystems
Energy characteristic of a processor allocator and a network-on-chip
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
| Hi-index | 0.00 |
We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing.