𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Necessary and Sufficient Conditions for Deadlock-Free Routing in Wormhole Networks

✍ Scribed by Verbeek, Freek; Schmaltz, Julien

Book ID
120253229
Publisher
IEEE
Year
2011
Tongue
English
Weight
910 KB
Volume
22
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Necessary and Sufficient Condition for
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
✍ Loren Schwiebert; D.N. Jayasimha πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 341 KB

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that

Efficient Deadlock-Free Wormhole Routing
Efficient Deadlock-Free Wormhole Routing and Virtual-Channel Reduction in Shuffle-Based Networks
✍ Hyunmin Park; Dharma P. Agrawal πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 401 KB

Many aspects of shuffle-based networks have recently been studied by numerous researchers. However, no attention has been paid to deadlock-free wormhole routing algorithms. In this paper, for a set of shuffle-based networks, we introduce a graph-partitioning technique that enables a deadlock-free ro