A Causal Model for Analyzing Distributed Concurrency Control Algorithms

Author

Bhargava, Bharat ; Hua, Cecil T.

Author_Institution

Department of Computer Science, University of Pittsburgh

Issue

4

fYear

1983

fDate

7/1/1983 12:00:00 AM

Firstpage

470

Lastpage

486

Abstract

An event order based model for specifying and analyzing concurrency control algorithms for distributed database systems has been presented. An expanded notion of history that includes the database access events as well as synchronization events is used to study the correctness, degree of concurrency, and other aspects of the algorithms such as deadlocks and reliability. The algorithms are mapped into serializable classes that have been defined based on the order of synchronization events such as lock points, commit point, arrival of a transaction, etc,.

Keywords

Causal graph; concurrency control; correctness; deadlock; degree of concurrency; distributed system; event order; history; reliability; serializability; time stamp; Algorithm design and analysis; Computer science; Concurrency control; Concurrent computing; Control system analysis; Database systems; History; Management information systems; Robustness; System recovery; Causal graph; concurrency control; correctness; deadlock; degree of concurrency; distributed system; event order; history; reliability; serializability; time stamp;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1983.234783

Filename

1703081