A concurrency control algorithm in a distributed environment

Authors:
Paul Decitre
Affiliations:
Centre de Recherche Cii-Honeywell Bull, Grenoble, France
Venue:
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Year:
1981

Citing 4
Cited 0

Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
The notions of consistency and predicate locks in a database system

Communications of the ACM
Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres

IEEE Transactions on Software Engineering
Formal Aspects of Serializability in Database Concurrency Control

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a continuation of the POLYPHEME study, the Cii-Honeywell Bull research center has launched a project on co-operating transactional systems with particular attention paid to distributed concurrency control and commitment. Following the presentation of the application-driven approach being taken, the distributed concurrency control algorithm is described as an improvement of the proposal made by Rosenkrantz, Stearns and Lewis. Salient technical features such as deadlock prevention, wrong aborts, parallel execution, and relation between concurrency control and commitment are detailed. Then the main choices are justified, and the rejected techniques criticized.