A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks

Conference · Sat Dec 31 04:00:00 EST 1994

OSTI ID:98895

Duato, J ^[1]

---

1. 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
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
MEMORY MANAGEMENT
OPTIMIZATION
PARALLEL PROCESSING
TASK SCHEDULING