A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
The turn model for adaptive routing
Journal of the ACM (JACM)
Improving the efficiency of virtual channels with time-dependent selection functions
Conference proceedings on PARLE'92
A necessary and sufficient condition for deadlock-free wormhole routing
Journal of Parallel and Distributed Computing
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
Wormhole routing techniques for directly connected multicomputer systems
ACM Computing Surveys (CSUR)
Characterization of Deadlocks in k-ary n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Flexible and Efficient Routing Based on Progressive Deadlock Recovery
IEEE Transactions on Computers
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
The Odd-Even Turn Model for Adaptive Routing
IEEE Transactions on Parallel and Distributed Systems
A Cost-Effective Approach to Deadlock Handling in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
A generic design methodology for deadlock-free routing in multicomputer networks
Journal of Parallel and Distributed Computing
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
A foundation for designing deadlock-free routing algorithms in wormhole networks
Journal of the ACM (JACM)
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
ICPP '97 Proceedings of the 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
The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
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
A New Mechanism for Congestion and Deadlock Resolution
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Self-Tuned Congestion Control for Multiprocessor Networks
HPCA '01 Proceedings of the 7th International Symposium on High-Performance Computer Architecture
IEEE Transactions on Parallel and Distributed Systems
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
A survey and comparison of wormhole routing techniques in a mesh networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
Different from traditional deadlock avoidance schemes, deadlock detection and recovery-based routing algorithms in wormhole networks have gained attention due to low hardware complexity and high routing adaptability. By its nature, current deadlock detection techniques based on time-out accompany unignorable number of false deadlock detections especially in a heavily loaded network or with long packet size and may mark more than one packet in a deadlock as deadlocked. This would saturate the resources allocated for recovery, making deadlock recovery schemes less viable. This paper proposes a simple but more accurate deadlock detection scheme which is less dependent on the time-out value. The proposed scheme uses a control packet to find a potential cyclic dependency between packets and presumes a deadlock only upon finding such dependency. The suggested scheme considerably reduces the probability of false deadlock detections over previous schemes, thus enabling more efficient deadlock recovery and higher network throughput. Simulation results are provided to demonstrate the efficiency of the proposed scheme.