ACM Home Page
Please provide us with feedback. Feedback
A distributed transaction processing protocol based on majority consensus
Full text PdfPdf (814 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing table of contents
Ottawa, Canada
Pages: 224 - 237  
Year of Publication: 1982
ISBN:0-89791-081-8
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 25,   Citation Count: 3
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/800220.806701
What is a DOI?

ABSTRACT

An n-failure-resilient protocol for distributed transaction processing regarding site crash, network partitioning, and local failures like abort of subtransactions is specified. The three-phased protocol contains concurrency control, a mechanism enforcing mutual consistency, and commitment based on majority consensus w.r.t. multiple copies of entities. To cope with transaction manager failures, backup processes for the manager are used. Data redundancy given by multiple copies in a partially redundant database is utilized to improve the resiliency of the protocol, i.e. to improve especially the successful commitment of update transactions processed by the protocol. The protocol is n-failure-resilient if the least redundant entity to be accessed by a transaction is mapped onto at least 2n+1 file copies in the distributed database.


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
Boudenant, J.: Some solutions for database recovery in SIRIUS-DELTA, Proc. 2nd Seminar on Distributed Data Sharing Systems, Amsterdam, 1981
 
5
Breitwieser, H.; Leszak, M.: Improving availability of partially redundant databases by majority consensus protocols, Proc. 2nd Int. Symp. on Distributed Databases, Berlin, Sept. 1982
 
6
Cheng, W.K.: The resiliency of fully replicated distributed databases, Proc. 6th Berkeley Workshop, 1982
 
7
Fraboul, C.: Robust mechanisms for maintaining a redundant distributed database, Proc. Int. Conf. on Databases, Aberdeen, 1980
8
 
9
10
 
11
International Organization for Standardization: Data processing - Open Systems Interconnection - Basic Reference Model, Draft proposal, ISO/DP 7498, January 1982
 
12
Lampson, B.; Sturgis, H.: Crash recovery in a distributed data storage system, Research Report, XEROX PARC, 1979
 
13
Lindsay, B.G. et.al: Notes on distributed databases, IBM Research Report RJ2571, 1979
14
 
15
Munz, R.: Transaction management in the distributed database system VDN, Proc. IFIP Congress, Tokyo, 1981
 
16
Popek, G.J. et.al: Detection of mutual inconsistencies in distributed systems, Proc. 5th Berkeley Workshop, 1981
17
18
 
19
Skeen, D.: A quorum-based commit protocol, Proc. 6th Berkeley Workshop, 1982
 
20
Stonebraker, M.: Concurrency control and consistency of multiple copies of data in distributed INGRES, IEEE TSE 3 (1979) 5, pp. 188-194
21
 
22
Toth, K.C.; Mahmoud, S.A.; Riordon, J.S.: Query processing strategies in a distributed database architecture, Proc. of the 2nd Sem. on Distributed Data Sharing Systems, Amsterdam, 1981
 
23
Walter, B.: A robust and efficient protocol for checking the availability of remote sites, Proc. 6th Berkeley Workshop, February 1982


Collaborative Colleagues:
H. Breitwieser: colleagues
M. Leszak: colleagues