Abstract :
Deadlock states are undesirable situations in any system,. Their avoiding presents a major issue in control of resource allocation systems (RAS), a theoretical paradigm, used in construction of e.g. flexible manufacturing systems. In coordinating RAS with processes containing concurrent execution in their development, it has been proved, that deadlock avoidance policies developed, for sequential RAS are applicable. This requires, however, a, transformation of the RAS structure from, coordinating to sequential, what brings the exponential growth of the modelled system, size. In, this paper, we present a deadlock, avoidance method that allows using the original coordinating RAS with additional data structures calculated before the system, starts. It is an enhanced, version of the banker´s algorithm, with, our proposed, data structures manipulation.
