Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Ariadne—an adaptive router for fault-tolerant multicomputers
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
The SP2 high-performance switch
IBM Systems Journal
An efficient, fully adaptive deadlock recovery scheme: DISHA
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
On deadlocks in interconnection networks
Proceedings of the 24th annual international symposium on Computer architecture
A Cost and Speed Model for k-ary n-Cube Wormhole Routers
IEEE Transactions on Parallel and Distributed Systems
Characterization of Deadlocks in k-ary n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Supporting systolic and memory communication in iWarp
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
Improving Performance of Networks of Workstations by using Disha Concurrent
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
DISHA: a deadlock recovery scheme for fully adaptive routing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Deadlock-Free Adaptive Routing Algorithms for the 3D-Torus: Limitations and Solutions
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks
HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Impact of Buffer Size on the Efficiency of Deadlock Detection
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
An adaptive deadlock and livelock free routing algorithm
PDP '95 Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing
Characterization of Deadlocks in k-ary n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
IEEE Transactions on Computers
On Message.Dependent Deadlocks in Multiprocessor/Multicomputer Systems
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Efficient Handling of Message-Dependent Deadlock
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems
IEEE Transactions on Parallel and Distributed Systems
The Double Scheme: Deadlock-free Dynamic Reconfiguration of Cut-Through Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
Analysis of true fully adaptive routing with software-based deadlock recovery
Journal of Systems and Software - Special issue: Computer systems
Evaluation of queue designs for true fully adaptive routers
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
A deadlock detection mechanism for true fully adaptive routing in regular wormhole networks
Computer Communications
Efficient Deadlock Detection in Parallel Computer Systems with Wormhole Routing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Cost-Effective buffered wormhole routing
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 14.98 |
The development of fully adaptive, cut-through (wormhole) networks is important for achieving high performance in communication-critical parallel processor systems. Increased flexibility in routing allows network bandwidth to be used efficiently, but also creates more opportunity for cyclic resource dependencies to form which can cause deadlock. If not guarded against, deadlocks in routing make packets block in the network indefinitely and, eventually, could result in the entire network coming to a complete standstill. This paper presents a simple, flexible, and efficient routing approach for multicomputer interconnection networks which is based on progressive deadlock recovery as opposed to deadlock avoidance or regressive deadlock recovery. Performance is optimized by allowing the maximum routing freedom provided by network resources to be exploited. True fully adaptive routing is supported in which all physical and virtual channels at each node in the network are available to packets without regard for deadlocks. Deadlock cycles, upon forming, are efficiently broken in finite time by progressively routing one of the blocked packets through a connected, deadlock-free recovery path. This new routing approach enables the design of high-throughput networks that provide excellent performance. Simulations indicate that progressive deadlock recovery routing can improve throughput by as much as 45 percent and 25 percent over leading deadlock avoidance-based and regressive recovery-based routing schemes, respectively.