A survey on distributed deadlock and distributed algorithms to detect and resolve deadlock

Operating system and distributed database system (DDS) are the most ordinary places where the chances for the occurrence of deadlock are very high. DDS is a database system which keeps the storage of multiple and logically interrelated databases on multiple computer systems connected over a large network in order to achieve optimal performance and resource sharing. In DDS a deadlock might encounter when a transaction request resource from other blocked transaction and enters into wait condition. It is more difficult to resolve deadlock in DDS as compare to resolution of deadlock in operating system because sites do not have exact knowledge of state of system. In this paper we are presenting a comparative study of various distributed algorithms such as B. M. Alom Algorithm and Edge-Chasing Algorithm for deadlock detection and resolution in DDS.