Extension of the Banker's algorithm for resource allocation in a distributed operating system
Information Processing Letters
Distributed algorithms and protocols
Distributed algorithms and protocols
Efficient deadlock-free routing
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Modern operating systems
Requirements for deadlock-free, adaptive packet routing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A practical deadlock avoidance algorithm for data base systems
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
| Hi-index | 14.98 |
A problem of deadlock avoidance in store-and-forward networks with at least two buffers per node is considered for fixed as well as dynamic routing. For both cases polynomial time, centralized deadlock avoidance algorithms are proposed and shown to be optimal in a sense of possible buffer utilization. When the number of buffers is equal to one for each node the problem is known to be NP-complete, thus, unlikely to admit a polynomial-time algorithm. The presented results may be also interesting for other applications, some massively parallel computer systems being one of the examples.