A Causal Model for Analyzing Distributed Concurrency Control Algorithms

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1983-07, Vol.SE-9 (4), p.470-486
Main Authors: Bhargava, B., Hua, C.T.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Analysis
Applied sciences
Causal graph
Computer science
Computer science
control theory
systems
Concurrency control
Concurrent computing
Control
Control algorithms
Control system analysis
correctness
Database systems
deadlock
degree of concurrency
Distributed processing
distributed system
event order
Exact sciences and technology
History
Information systems. Data bases
Management information systems
Memory organisation. Data processing
reliability
Robustness
serializability
Software
System recovery
Systems
time stamp
Verification
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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,.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1983.234783