An abortion-free distributed deadlock detection/resolution algorithm

Author

Shyu, S.C. ; Li, Victor O K ; Wang, C.P.

Author_Institution

Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA

fYear

1990

fDate

28 May-1 Jun 1990

Firstpage

167

Lastpage

174

Abstract

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

Keywords

concurrency control; distributed databases; distributed processing; system recovery; transaction processing; DISF; abortion-free algorithm; abortion-free distributed deadlock detection/resolution algorithm; deadlock cycle; distributed databases; read/write lock requests; transaction abortions; transaction classes; transaction reordering; transaction response time; wait-for relations; Abortion; Concurrency control; Database systems; Degradation; Delay; Detection algorithms; Distributed databases; Probes; System recovery; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1990. Proceedings., 10th International Conference on

Conference_Location

Paris

Print_ISBN

0-8186-2048-X

Type

conf

DOI

10.1109/ICDCS.1990.89269

Filename

89269