๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Decision Procedure for Deadlock-Free Routing in Wormhole Networks

โœ Scribed by Verbeek, Freek; Schmaltz, Julien

Book ID
125841621
Publisher
IEEE
Year
2014
Tongue
English
Weight
327 KB
Volume
25
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

A Generic Design Methodology for Deadloc
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
โœ Hyunmin Park; Dharma P. Agrawal ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-d