ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Game interpretation of the deadlock avoidance problem
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
The Logical Design of Operating Systems
The Logical Design of Operating Systems
A polynomial-time test for the deadlock-freedom of computer systems
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
Network flow and generalized path compression
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Deadlock-free packet switching networks
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Avoiding deadlock in distributed data bases
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Journal of the ACM (JACM)
Design of Minimum-Cost Deadlock-Free Systems
Journal of the ACM (JACM)
On-the-fly deadlock prevention
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Deadlock problem: a classifying bibliography
ACM SIGOPS Operating Systems Review
Deadlock-Free Systems for a Bounded Number of Processes
IEEE Transactions on Computers
| Hi-index | 0.01 |
The problem of determining whether it is possible for a set of “free-running” processes to become deadlocked is considered. It is assumed that any request by a process is immediately granted as long as there are enough free resource units to satisfy the request. The question of whether or not there exists a polynomial algorithm for predicting deadlock in a “claim-limited” serially reusable resource system has been open. An algorithm employing a network flow technique is presented for this purpose. Its running time is bounded by O(mn1.5) if the system consists of n processes sharing m types of serially reusable resources.