Affiliation:
1. Department of Electrical Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Abstract
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
(
mn
1.5
) if the system consists of
n
processes sharing
m
types of serially reusable resources.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference23 articles.
1. BERGE C The Theory of Graphs and Its Apphca ons. Methuen London 1962. BERGE C The Theory of Graphs and Its Apphca ons. Methuen London 1962.
2. System Deadlocks
3. Game interpretation of the deadlock avoidance problem
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deadlock Avoidance Algorithms for Recursion-Tree Modeled Requests in Parallel Executions;IEEE Transactions on Computers;2021
2. Methodische und technische Grundlagen;Echtzeitsysteme;2019-11-27
3. Towards an ASM-based Characterization of the Deadlock-freedom Property;Proceedings of the 11th International Joint Conference on Software Technologies;2016
4. A Modified Banker’s Algorithm;Lecture Notes in Electrical Engineering;2012-08-28
5. On Dijkstra’s Algorithm for Deadlock Detection;Advanced Techniques in Computing Sciences and Software Engineering;2009-12-15