Loading...
Please wait, while we are loading the content...
Similar Documents
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Jayasimha, D. N. Schwiebert, Loren |
| Abstract | 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 can be used for any adaptive or nonadaptive routing algorithm for wormhole routing, as long as only local information is required for routing. The underlying proof technique introduces a new type of dependency graph, the channel waiting graph, which omits most channel dependencies that cannot be used to create a deadlock configuration. The necessary and sufficient condition can be applied in a straightforward manner to most routing algorithms. This is illustrated by proving deadlock freedom for a partially adaptive nonminimal mesh routing algorithm that does not require virtual channels and a fully adaptive minimal hypercube routing algorithm with two virtual channels per physical channel. Both routing algorithms are more adaptive than any previously proposed routing algorithm with similar virtual channel requirements. |
| File Format | |
| Journal | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Deadlock Freedom Underlying Proof Technique Routing Algorithm Adaptive Minimal Hypercube Sufficient Condition Deadlock-free Adaptive Routing Deadlock-free Wormhole Routing Physical Channel Virtual Channel Channel Dependency Dependency Graph Straightforward Manner Adaptive Nonminimal Mesh Similar Virtual Channel Requirement Wormhole Routing Nonadaptive Routing Algorithm Restricted Class New Type Local Information Important Open Problem Deadlock Configuration |
| Content Type | Text |
| Resource Type | Article |