Operation systems: advanced concepts
Operation systems: advanced concepts
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
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 New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Compressionless routing: a framework for adaptive and fault-tolerant routing
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
A necessary and sufficient condition for deadlock-free wormhole routing
Journal of Parallel and Distributed Computing
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
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Characterization of Deadlocks in Interconnection Networks
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
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
A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes
IEEE Transactions on Computers
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
A Cost-Effective Approach to Deadlock Handling 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
Performance Evaluation of a New Hardware Supported Multicast Scheme for K-ary N-cubes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Performance Enhancement Techniques for InfiniBand" Architecture
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Analysis of true fully adaptive routing with software-based deadlock recovery
Journal of Systems and Software - Special issue: Computer systems
A Family of Mechanisms for Congestion Control in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
A performance model of compressionless routing in k-ary n-cube networks
Performance Evaluation
Throughput fairness in k-ary n-cube networks
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Exploring IBA Design Space for Improved Performance
IEEE Transactions on Parallel and Distributed Systems
Characterizing the Cell EIB On-Chip Network
IEEE Micro
Designing efficient irregular networks for heterogeneous systems-on-chip
Journal of Systems Architecture: the EUROMICRO Journal
Efficient implementation of globally-aware network flow control
Journal of Parallel and Distributed Computing
Proceedings of the 27th international ACM conference on International conference on supercomputing
Hi-index | 0.01 |
Deadlock avoidance-based and deadlock recovery-based routing algorithms have been proposed in recent years without full understanding of the likelihood and characteristics of actual deadlocks in interconnection networks. This work models the interrelationships between routing freedom, message blocking, correlated resource dependencies and deadlock formation. We empirically show that increasing routing freedom, as achieved by allowing unrestricted routing over multiple virtual channels, makes deadlocks highly improbable and reduces the likelihood of other types of correlated message blocking behavior that can degrade performance. Our results further substantiate that recovery-based routing algorithms have a higher potential performance advantage over deadlock avoidance-based routing algorithms which, inherently, allow less routing freedom.