A scalable deadlock avoidance policy for batch processes

Author

Tittus, M. ; Ferreira, P.M.

Author_Institution

Sch. of Eng, Univ. Coll. Boras, Sweden

Volume

5

fYear

2000

fDate

2000

Firstpage

3528

Abstract

Allocating non-sharable resources for jobs in batch processes can lead to deadlocks. Using colored digraphs to model the wait-relationship between resources in a job-path, a graph-theoretic approach is proposed to give necessary conditions for the existence of unsafe system states, i.e., allocations that will prevent some jobs from successful execution. Based on these necessary conditions a correct and scalable control policy for deadlock avoidance is given, which is somewhat conservative and allows some trade-off between computational complexity and permissiveness

Keywords

batch processing (industrial); computational complexity; directed graphs; optimal control; production control; resource allocation; Banker algorithm; batch processes; colored digraphs; computational complexity; deadlock avoidance; graph-theory; necessary conditions; optimal control; permissiveness; resource allocation; Computational complexity; Educational institutions; Graph theory; Industrial control; Optimal control; Polynomials; Real time systems; Resource management; State feedback; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2000. Proceedings of the 2000

Conference_Location

Chicago, IL

ISSN

0743-1619

Print_ISBN

0-7803-5519-9

Type

conf

DOI

10.1109/ACC.2000.879226

Filename

879226