Computer Communication Networks: Approaches, Objectives, and Performance Considerations
ACM Computing Surveys (CSUR)
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
High performance hypercube communications
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A hierarchical solution for application level store-and-forward deadlock prevention
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Load balanced deadlock-free deterministic routing of arbitrary networks
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
A parallel simulator for performance modelling of broadband telecommunication networks
WSC '92 Proceedings of the 24th conference on Winter simulation
Testing Deadlock-Freedom of Computer Systems
Journal of the ACM (JACM)
Design of Minimum-Cost Deadlock-Free Systems
Journal of the ACM (JACM)
Routing in the bidirectional shufflenet
IEEE/ACM Transactions on Networking (TON)
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network
IEEE Transactions on Parallel and Distributed Systems
Deadlock- and livelock-free packet switching networks
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks
IEEE Transactions on Computers
| Hi-index | 0.01 |
Deadlock is one of the most serious system failures that can occur in a computer system or a network. Deadlock states have been observed in existing computer networks emphasizing the need for carefully designed flow control procedures (controllers) to avoid deadlocks. Such a deadlock-free controller is readily found if we allow it global information about the overall network state. Generally, this assumption is not realistic, and we must resort to deadlock free local controllers using only packet and node information. We present here several types of such controllers, we study their relationship and give a proof of their optimality with respect to deadlock free controllers using the same set of local parameters.