The Community for Technology Leaders
Green Image
Issue No. 03 - May/June (2003 vol. 15)
ISSN: 1041-4347
pp: 721-733
P. Krishna Reddy , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed “edge detection” approach, a graph-based resolution of access conflicts has been adopted. The technique generates a uniform wait-for precedence order at distributed sites for transactions to execute. The earlier methods based on serialization graph testing are difficult to implement in a distributed environment. The edge detection approach is a fully distributed approach. It presents a unified technique for locking and deadlock detection exercises. The technique eliminates many deadlocks without incurring message overheads.</p>
INDEX TERMS
Concurrency control, deadlock avoidance, distributed algorithms, distributed databases, nonblocking protocols, serializability.
CITATION

S. Bhalla and P. K. Reddy, "Asynchronous Operations in Distributed Concurrency Control," in IEEE Transactions on Knowledge & Data Engineering, vol. 15, no. , pp. 721-733, 2003.
doi:10.1109/TKDE.2003.1198401
90 ms
(Ver 3.3 (11022016))