DocumentCode
2202430
Title
Variations of Banker´s algorithm for highly flexible resource allocation systems
Author
Reveliotis, Spiridon A.
Author_Institution
Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume
1
fYear
1998
fDate
11-14 Oct 1998
Firstpage
600
Abstract
We show that the generic logic underlying the classical Banker´s algorithm (Habermann, 1969), is a very flexible and powerful tool for developing correct and computationally efficient deadlock avoidance policies for a broad variety of structural control applications arising in contemporary large-scale flexibly automated environments. Although we draw our examples from the manufacturing domain, it can be clearly seen that similar problems arise in the context of other technological applications, e.g., monorail transportation systems.
Keywords
computational complexity; flexible manufacturing systems; graph theory; resource allocation; search problems; Banker´s algorithm; deadlock avoidance policies; generic logic; highly flexible resource allocation systems; large-scale flexibly automated environments; Digital audio players; Electrical equipment industry; Manufacturing automation; Manufacturing industries; Polynomials; Resource management; Routing; System recovery; Systems engineering and theory; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
ISSN
1062-922X
Print_ISBN
0-7803-4778-1
Type
conf
DOI
10.1109/ICSMC.1998.725478
Filename
725478
Link To Document