Title :
Replicated transactions
Author :
Ng, Tony P. ; Shi, Shepherd S B
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
A scheme to replicate transactions is described. The scheme allows a k-replicated transaction to survive (k-1) failures. No coordination among the k replicas is needed until one of them reaches the end and proceeds to abort the others. Consequently, the scheme avoids the overhead and delay caused by failure detection reconfiguration, and synchronization during the k replicas´ execution. A robust commit protocol to choose the transaction replica that should be committed and a procedure to choose the nodes on which a transaction replica is executed are described. The goal of the procedure is to maximize reliability
Keywords :
database management systems; fault tolerant computing; protocols; synchronisation; delay; failure detection reconfiguration; overhead; reliability; replicated transactions; robust commit protocol; synchronization; Computer science; Concurrent computing; Condition monitoring; Content addressable storage; Delay; Distributed computing; Fault tolerance; Protocols; Robustness; Timing;
Conference_Titel :
Distributed Computing Systems, 1989., 9th International Conference on
Conference_Location :
Newport Beach, CA
Print_ISBN :
0-8186-1953-8
DOI :
10.1109/ICDCS.1989.37979
