Graphical Deadlock Avoidance

Deadlock avoidance in sequential resource allocation and concurrency control is a well-defined problem. The problem is extensively studied and investigated in order to define a safe, i.e. deadlock free, scheduling mechanism to a set of finite-resources. Originally a simple graphical solution has been given theoretically, however, practically the problem has been studied by defining deadlock avoidance policies (DAP) proved to be NP-hard through different formal frameworks using Petri nets and finite state automata. In this paper a new technique is proposed as an extension to the original graphical solution.