Deadlock-Free Systems for a Bounded Number of Processes

Authors:
T. Ibaraki;T. Kameda
Affiliations:
Department of Applied Mathematics and Physics, Kyoto University;-
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 7
Cited 0

Testing Deadlock-Freedom of Computer Systems

Journal of the ACM (JACM)
System Deadlocks

ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems

ACM Computing Surveys (CSUR)
Compact finite difference schemes for ocean models: 1. Ocean waves

Journal of Computational Physics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Avoiding deadlock in multitasking systems

IBM Systems Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

Consider a computer system in which different types of serially reusable resources are shared by several classes of processes. We assume that each process in a process class has the same known maximum claim (i.e., the maximum resource requirement), but that the actual sequence of requests is unknown. Our resource manager uses the "expedient policy" in granting requests for resources, under the constraint that at most K (a constant) processes can reside in the system at any time.