Freedom from deadlock of locked transactions in a distributed database

1 January 1983

proceedings article
Published by Association for Computing Machinery (ACM)

p. 267-276
https://doi.org/10.1145/800221.806727

Abstract

We examine the problem of determining whether a given set of locked transactions, accessing a distributed database, is free from deadlock. A deadlock graph is used to derive a new characterization for deadlock-free two-transaction systems in a distributed environment. The characterization provides a direct and efficient polynomial test for deadlock-freedom in two-transaction systems. The method is not dependent on the number of sites in a distributed database, and hence improves previously known results, which are exponential in the number of sites.

Keywords

TWO-TRANSACTION SYSTEM
DEADLOCK GRAPH
NEW CHARACTERIZATION
LOCKED TRANSACTION
DEADLOCK-FREE TWO-TRANSACTION SYSTEM
EFFICIENT POLYNOMIAL TEST
DISTRIBUTED ENVIRONMENT
DISTRIBUTED DATABASE
ROLE

This publication has 0 references indexed in Scilit: