ACM Home Page
Please provide us with feedback. Feedback
A fault-tolerant commit protocol for replicated databases
Full text PdfPdf (981 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
San Diego, California, United States
Pages: 139 - 148  
Year of Publication: 1992
ISBN:0-89791-519-4
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/137097.137855
What is a DOI?

ABSTRACT

When failures occur during the execution of distributed commit protocols, the protocols may block in some partitions to avoid inconsistent termination of the transaction, thus making data items in these partitions unavailable for accesses. We present a protocol that incorporates two new ideas with the goal of improving data availability. First, a new two-level voting scheme is proposed for deciding in which partitions to terminate the transaction. In this scheme, a choice is made based on the number of data items available in the partition rather than on the number of individual nodes. Indeed, in replicated systems, a criterion based on the number of nodes may be misleading. Second, we propose a way to reduce blocking caused by accumulating network fragmentation. The idea employs the views mechanism previously used in replica management.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
H. Garcia-Molina. Elections in a distributed computing system. IEEE Trans. Computers, C-31 (1), pp. 48-59, January 1982.
5
 
6
7
 
8
A. Kumar. Performance analysis of a hierarchical quorum consensus algorithm for replicated objects. In Proc. of lOth Symp. on Distributed Computing Sys., pp. 378- 385, IEEE, 1990.
9
10
11
 
12
D. Skeen. A quorum-based commit protocol. In Proc. of the 6th Berkeley Workshop on Distr. Data Management and Comp. Networks, pp. 69-80, 1982.
 
13
D. Skeen and M.Stonebraker. A formal model of crash recovery in a distributed system. IEEE Trans. on Software Eng., 9(3), pp. 219-228, May 1983.
14
15


Collaborative Colleagues:
Michael Rabinovich: colleagues
Edward D. Lazowska: colleagues