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 | Schwiebert, Loren Jayasimha, D. N. |
| 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. B... |
| File Format | |
| Volume Number | 32 |
| Journal | Journal of Parallel and Distributed Computing |
| Language | English |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Sufficient Condition Deadlock-free Wormhole Routing Wormhole Routing Virtual Channel Adaptive Nonminimal Mesh New Type Deadlock Configuration Important Open Problem Dependency Graph Physical Channel Deadlock Freedom Straightforward Manner Routing Algorithm Underlying Proof Technique Adaptive Minimal Hypercube Channel Dependency Nonadaptive Routing Algorithm Deadlock-free Adaptive Routing Local Information Restricted Class |
| Content Type | Text |
| Resource Type | Article |