In distributed systems, a lot of algorithms using the probe message presented for deadlock detection and resolution. But these algorithms have been considered only an exclusive lock for the concurrency control of transactions. We found that these algo...
In distributed systems, a lot of algorithms using the probe message presented for deadlock detection and resolution. But these algorithms have been considered only an exclusive lock for the concurrency control of transactions. We found that these algorithms had an efficiency, but the incorrect problem.
Therefore we have been published algorithems for solving the incorrected problem in conferences, continually have been studied algorithms considering a shared lock for improving the concurrency of transactions.
In this thesis, We find the problem of Sinha's algorithm considering a shared lock, and as aolution, present the improved algorithm.