Deadlock avoidance policies for resource allocation systems with applications to FMS
Conference Paper
Overview
Additional Document Info
View All
Overview
abstract
The problem of deadlock avoidance for a class of Resource Allocation Systems (RAS) called the Single-Unit RAS (SU-RAS) is discussed with particular application to buffer space allocation in a Flexible Manufacturing System. For a class of SU-RAS, it is shown that the problem of obtaining the maximally permissive deadlock avoidance policy is of polynomial complexity. Suboptimal policies (which are not maximally permissive) for SU-RAS are also discussed.