Two-phase commit protocol

About: Two-phase commit protocol is a research topic. Over the lifetime, 977 publications have been published within this topic receiving 24375 citations. The topic is also known as: 2PC.

Transaction Processing: Concepts and Techniques

Abstract: From the Publisher: The key to client/server computing. Transaction processing techniques are deeply ingrained in the fields of databases and operating systems and are used to monitor, control and update information in modern computer systems. This book will show you how large, distributed, heterogeneous computer systems can be made to work reliably. Using transactions as a unifying conceptual framework, the authors show how to build high-performance distributed systems and high-availability applications with finite budgets and risk. The authors provide detailed explanations of why various problems occur as well as practical, usable techniques for their solution. Throughout the book, examples and techniques are drawn from the most successful commercial and research systems. Extensive use of compilable C code fragments demonstrates the many transaction processing algorithms presented in the book. The book will be valuable to anyone interested in implementing distributed systems or client/server architectures.

The Recovery Manager of the System R Database Manager

Abstract: The recovery subsystem of an experimental data management system is described and evaluated. The transactmn concept allows application programs to commit, abort, or partially undo their effects. The DO-UNDO-REDO protocol allows new recoverable types and operations to be added to the recovery system Apphcation programs can record data m the transaction log to facilitate application-specific recovery. Transaction undo and redo are based on records kept in a transaction log. The checkpoint mechanism is based on differential fries (shadows). The recovery log is recorded on disk rather than tape.

A fair non-repudiation protocol

Abstract: A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We present a fair non-repudiation protocol that requires a trusted third party but attempts to minimize its involvement in the execution of the protocol. We draw particular attention to the nonstandard use of encryption in our protocol and discuss some aspects of its formal verification.

Consensus on transaction commit

Abstract: The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement, but do not block whenever any majority of the processes are working. The Paxos Commit algorithm runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2F p 1 coordinators and makes progress if at least F p 1 of them are working properly. Paxos Commit has the same stable-storage write delay, and can be implemented to have the same message delay in the fault-free case as Two-Phase Commit, but it uses more messages. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the Paxos Commit algorithm.

Self-stabilization of dynamic systems assuming only read/write atomicity

Abstract: Three self-stabilizing protocols for distributed systems in the shared memory model are presented The first protocol is a mutual-exclusion protocol for tree structured systems The second protocol is a spanning tree protocol for systems with any connected communication graph The third protocol is obtained by use of fair protocol combination, a simple technique which enables the combination of two self-stabilizing dynamic protocols The result protocol is a self-stabilizing, mutual-exclusion protocol for dynamic systems with a general (connected) communication graph The presented protocols improve upon previous protocols in two ways: First, it is assumed that the only atomic operations are either read or write to the shared memory Second, our protocols work for any connected network and even for dynamic networks, in which the topology of the network may change during the execution