An abortion-free distributed deadlock detection/resolution algorithm

A distributed deadlock detection/resolution algorithm is proposed. In this algorithm, when a deadlock cycle is detected, it is resolved by reordering the wait-for relations between pairs of transactions. Therefore, no transaction abortions are necessary to resolve deadlock cycles. This results in fewer messages and smaller transaction response time. The correctness of this abortion-free algorithm is proved. The abortion-free algorithm can be extended to handle read/write lock requests and to distinguish between transaction classes.<>