Efficient commit protocols for the tree of processes model of distributed transactions
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 19 (2) , 40-52
- https://doi.org/10.1145/850770.850772
Abstract
This paper describes two efficient distributed transaction commit protocols, the Presumed Abort (PA) and Presumed Commit (PC) protocols, which have been implemented in the distributed data base system R* [DSHLM82, LHMWY83]. PA and PC are extensions of the well-known two-phase (2P) commit protocol [Gray78, Lamp80, LSGGL80]. PA is optimized for read-only transactions and a class of multi-site update transactions, and PC is optimized for other classes of multi-site update transactions. The optimizations result in reduced inter-site message traffic and log writes, and, consequently, a better response time for such transactions. We derive the new protocols in a step-wise fashion by modifying the 2P protocol.Keywords
This publication has 8 references indexed in Scilit:
- Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processorsPublished by Association for Computing Machinery (ACM) ,1983
- Computation & communication in RPublished by Association for Computing Machinery (ACM) ,1983
- Analysis of distributed commit protocolsPublished by Association for Computing Machinery (ACM) ,1982
- The Recovery Manager of the System R Database ManagerACM Computing Surveys, 1981
- Nonblocking commit protocolsPublished by Association for Computing Machinery (ACM) ,1981
- Reliability mechanisms for SDD-1ACM Transactions on Database Systems, 1980
- Introduction to a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- Concurrency Control and Consistency of Multiple Copies of Data in Distributed IngresIEEE Transactions on Software Engineering, 1979