Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An Efficient Distributed Knot Detection Algorithm
IEEE Transactions on Software Engineering
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
On characterization and correctness of distributed deadlock detection
Journal of Parallel and Distributed Computing
Compressionless routing: a framework for adaptive and fault-tolerant routing
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
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
On deadlocks in interconnection networks
Proceedings of the 24th annual international symposium on Computer architecture
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
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
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
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
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
ICPP '97 Proceedings of the international Conference 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
A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks
HPCA '98 Proceedings of the 4th 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 Irregular Networks
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Characterization of deadlocks in interconnection networks
Characterization of deadlocks in interconnection networks
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
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
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
A Safe Algorithm for Resolving OR Deadlocks
IEEE Transactions on Software Engineering
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
IEEE Transactions on Parallel and Distributed Systems
Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
A deadlock detection mechanism for true fully adaptive routing in regular wormhole networks
Computer Communications
Simple deadlock-free dynamic network reconfiguration
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
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.00 |
This paper presents a theoretical model of resource allocations and dependencies in wormhole and virtual cut-through interconnection networks. This model allows various types of message blocking to be described precisely, including deadlock. The model distinguishes between messages involved in deadlock and those simply dependent upon deadlock, thus establishing a framework for evaluating the accuracy and correctness of deadlock detection mechanisms. The paper also identifies the necessary and sufficient conditions for the occurrence and resolution of deadlock in interconnection networks, thus providing efficiency and correctness criteria for deadlock resolution mechanisms. Theorems derived from the model are related to various routing algorithms which are based on deadlock recovery.