A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
- Universidad Politecnica de Valencia (Spain)
Deadlock avoidance is a key issue in wormhole networks. A first approach consists of removing the cyclic dependencies between channels. Although this is a necessary and sufficient condition for deadlock-free deterministic routing, it is only a sufficient condition for deadlock-free adaptive routing. A more powerful approach only requires the absence of cyclic dependencies on a connected channel subset. The remaining channels can be used in almost any way. In this paper, we propose a necessary and sufficient condition for deadlock-free adaptive routing. This condition is the key for the design of maximally adaptive routing algorithms with minimum restrictions. Some examples are given, showing the application of the new theory. In particular, we propose a partially adaptive routing algorithm for k-ary n-cubes which doubles the throughput without increasing the hardware complexity significantly.
- OSTI ID:
- 98895
- Report Number(s):
- CONF-940856-; CNN: Grant TIC91-1157-C03-03; TRN: 94:008346-0027
- Resource Relation:
- Conference: 1994 international conference on parallel processing, St. Charles, IL (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Proceedings of the 1994 international conference on parallel processing. Volume 1: Architecture; Agrawal, D.P. [ed.]; PB: 330 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
A framework for adaptive routing in multicomputer networks
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks