This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deadlock-Free Systems for a Bounded Number of Processes
March 1982 (vol. 31 no. 3)
pp. 188-193
T. Ibaraki, Department of Applied Mathematics and Physics, Kyoto University
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.
Index Terms:
resource allocation, Algorithm complexity, deadlock, deadlock prevention, NP-complete, operating system
Citation:
T. Ibaraki, T. Kameda, "Deadlock-Free Systems for a Bounded Number of Processes," IEEE Transactions on Computers, vol. 31, no. 3, pp. 188-193, March 1982, doi:10.1109/TC.1982.1675974
Usage of this product signifies your acceptance of the Terms of Use.