DocumentCode :
1744188
Title :
A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings
Author :
Park, Jonghun ; Reveliotis, Spyros A.
Author_Institution :
Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume :
3
fYear :
2000
fDate :
2000
Firstpage :
2663
Abstract :
The need for effective and efficient deadlock avoidance policies (DAPs) is ever increasing due to the higher demand for system automation. This paper considers the deadlock avoidance problem for the class of conjunctive/disjunctive (sequential) resource allocation systems (C/D-RAS), in which multiple resource acquisitions and flexible routings are allowed. A new siphon-based characterization of deadlocks arising in C/D-RAS is developed, and subsequently, this characterization facilitates the development of a polynomial complexity deadlock avoidance policy for the considered RAS class. The developed policy can be perceived as a generalization of RUN DAP, originally developed for sequential RAS with unit resource allocations and no routing flexibility. The proposed approach is demonstrated by an example
Keywords :
Petri nets; computational complexity; operations research; resource allocation; Petri net; deadlock avoidance; flexible routings; liveness; polynomial complexity; resource acquisitions; resource allocation; Automatic control; Automation; Control systems; Digital audio players; Polynomials; Resource management; Routing; System recovery; Systems engineering and theory; Taxonomy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
Conference_Location :
Sydney, NSW
ISSN :
0191-2216
Print_ISBN :
0-7803-6638-7
Type :
conf
DOI :
10.1109/CDC.2000.914207
Filename :
914207
Link To Document :
بازگشت