A Review Survey on Deadlock Detection in Multithreading

Deadlock freedom is the major challenge in developing multithreading programs. To avoid the potential risk of blocking a program, prior monitoring of threads can be made during the execution process. The proper monitoring scheme can monitor the threads and can identify whether the threads might enter a deadlock stage. It maintains a back up to store the threads. So after the execution of one thread the injection of the other thread can be made from backup into the processing stage. By using this process the deadlock can be avoided in the multithreading environment. In the proposed system, the thread monitoring and thread mapping techniques are implemented to identify the threads running in the program. A map is present which is used to store the thread objects, the locks acquired and requested by them. Whenever a thread tries to acquire a lock and if the access is denied, then it waits for certain period of time. After the time period expires, the thread again tries to access the lock.