Title :
Graphical Deadlock Avoidance
Author :
El-Kafrawy, Passent M.
Author_Institution :
Dept. of Math & Comput. Sci., Menoufia Univ., Shebin-ElKom, Egypt
Abstract :
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.
Keywords :
Petri nets; computational complexity; computer graphics; concurrency control; finite state machines; resource allocation; NP-hard problems; concurrency control; finite state automata; graphical deadlock avoidance; petri nets; scheduling mechanism; sequential resource allocation; Automata; Computational complexity; Concurrency control; Job shop scheduling; Petri nets; Processor scheduling; Resource management; System recovery; Telecommunication computing; Telecommunication control; Concurrency Control; Inter-Diagrammatic Reasoning; Isothetic Rectangles; Resource Allocation System; deadlock Avoidance;
Conference_Titel :
Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on
Conference_Location :
Trivandrum, Kerala
Print_ISBN :
978-1-4244-5321-4
Electronic_ISBN :
978-0-7695-3915-7
DOI :
10.1109/ACT.2009.83
