The Community for Technology Leaders
Green Image
Issue No. 04 - July (1983 vol. 9)
ISSN: 0098-5589
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,.
time stamp, Causal graph, concurrency control, correctness, deadlock, degree of concurrency, distributed system, event order, history, reliability, serializability

C. Hua and B. Bhargava, "A Causal Model for Analyzing Distributed Concurrency Control Algorithms," in IEEE Transactions on Software Engineering, vol. 9, no. , pp. 470-486, 1983.
92 ms
(Ver 3.3 (11022016))