This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Causal Model for Analyzing Distributed Concurrency Control Algorithms
July 1983 (vol. 9 no. 4)
pp. 470-486
B. Bhargava, Department of Computer Science, University of Pittsburgh
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,.
Index Terms:
time stamp, Causal graph, concurrency control, correctness, deadlock, degree of concurrency, distributed system, event order, history, reliability, serializability
Citation:
B. Bhargava, C.T. Hua, "A Causal Model for Analyzing Distributed Concurrency Control Algorithms," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 470-486, July 1983, doi:10.1109/TSE.1983.234783
Usage of this product signifies your acceptance of the Terms of Use.