Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The network architecture of the Connection Machine CM-5 (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
The SP2 high-performance switch
IBM Systems Journal
A necessary and sufficient condition for deadlock-free wormhole routing
Journal of Parallel and Distributed Computing
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
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 Solution to Coherence Problems in Multicache Systems
IEEE Transactions on Computers
Efficient Handling of Message-Dependent Deadlock
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Temporal isolation on multiprocessing architectures
Proceedings of the 48th Design Automation Conference
| Hi-index | 0.00 |
The existence of multiple message types and associated intermessage dependencies in multiprocessor/multicomputer systems may cause message-dependent deadlock in networks that are designed to be free of routing deadlock. In this paper, we characterize the frequency of message-dependent deadlocks using empirical methods. Results show that message-dependent deadlocks occur very infrequently under typical circumstances, thus rendering approaches based on avoiding them overly restrictive in the common case.