الفهرس 
A Minimum Time Deadlock Detection TechniqueOnly 14 pages are availabe for public view
 |  | from | 119 |  |  |
| | | from | 119 | | |
Abstract
Deadlock is one of the most important problems in uniprocessor or multiprocessor systems. Many algorithms have been introduced for the detection of deadlock. The research problem: suffer from increasing the number of processes, while the others take long processing time. Aim of the study: This thesis introduce an efficient technique for deadlock detection based on a simple structure lists which represent the relation between resources and processes for faster and accurate detection, also, creates a new vision for scheduling the processes in order to forecast which one causes the deadlock and that add reliability to the system. Study procedures: this thesis is to study all information lead to true deadlock at the same time to avoid the false one. For this purpose a simulator is also designed to implement and evaluate the proposed technique. The simulator consists of four instant lists. These lists are Acquire list, Lock list, Wait list and Wait_for list. The Thesis conclusion: Simulation results show that the technique is capable of defining the deadlock initiator and minimizing the long run mean average cost of detection. The results obtained from simulation also show that the proposed technique provides the best results.