DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks

Authors:
Pedro López;Juan Miguel Martínez;José Duato
Affiliations:
-;-;-
Venue:
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Year:
1998

Citing 0
Cited 10

Flexible and Efficient Routing Based on Progressive Deadlock Recovery

IEEE Transactions on Computers
A Cost-Effective Approach to Deadlock Handling in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
A comparative study of arbitration algorithms for the Alpha 21364 pipelined router

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
FC3D: Flow Control-Based Distributed Deadlock Detection Mechanism for True Fully Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Distributed Resolution of Network Congestion and Potential Deadlock Using Reservation-Based Scheduling

IEEE Transactions on Parallel and Distributed Systems
A Family of Mechanisms for Congestion Control in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Analysis and optimization of prediction-based flow control in networks-on-chip

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A new congestion control algorithm for improving the performance of a broadcast-based multiprocessor architecture

Journal of Parallel and Distributed Computing
Entropy throttling: a physical approach for maximizing packet mobility in interconnection networks

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
A new injection limitation mechanism for wormhole networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deadlock avoidance and recovery techniques are alternatives to deal with the interconnection network deadlock problem. Both techniques allow fully adaptive routing on some set of resources while providing dedicated resources to escape from deadlock. They mainly differ in the way they supply escape paths and when those paths are used. As the escape paths only provide limited bandwidth to escape from deadlocks, both techniques suffer from severe performance degradation when the network is close to saturation. On the other hand, deadlock recovery is based on the assumption that deadlocks are rare. Several studies show that deadlocks are more prone when the network is close to or beyond saturation.In this paper we propose a new mechanism that prevents network saturation by dynamically adjusting message injection limitation into the network. As a consequence, this mechanism will avoid the performance degradation problem that typically occurs in both deadlock avoidance and recovery techniques, making fully adaptive feasible. Also, it will guarantee that the frequency of deadlock is really negligible, allowing the use of simple low-cost recovery strategies.