This paper presents a new atomic commitment protocol that always allows a quorum in the system to make progress. Previously suggested quorum-based protocols (e.g. [12]) allow a quorum to make progress in case of one failure. If failures cascade, however, and the quorum in the system is "lost" (i.e. at a given time no quorum component exists, e.g. because of a total crash), a quorum can later become connected and still remain blocked. The importance of this work is in demonstrating, using a simple algorithm, how protocols that always allow a majority to make progress can be constructed. 1 Introduction Reliability and availability of loosely coupled distributed database systems is becoming a requirement for many installations, and...
The implicit yes--vote commit protocol (IYV), proposed for future gigabit--networked distributed dat...
We introduce the concept of unreliable failure detectors and study how they can be used to solve Con...
International audienceWhile consensus is at the heart of many coordination problems in asynchronous ...
This paper presents a new atomic commitment protocol, Enhanced Three Phase Commit (E3PC ), that alw...
This paper presents a new atomic commitment protocol, enhanced three phase commit (E3PC ), that alw...
A quorum-based commit and termination protocol is designed with the goal of maintaining high data av...
Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site ...
An atomic commit protocol can cause long-term locking of databases if the coordinator crashes or bec...
Agreement problems allow a set of processes to agree on a common output value. These problems are of...
Agreement problems allow a set of processes to agree on a common output value. These problems are of...
In distributed transactional systems, an Atomic Commitment Protocol (ACP) is used to ensure the atom...
This paper describes a solution to the Atomic Broadcast problem in asynchronous distributed systems ...
We introduce the concept of unreliable failure detectors and study how they can be used to solve Con...
Abstract. This work introduces a highly modular derivation of fast non-blocking atomic commit protoc...
In a client-server architecture, replicated copies of an object are assigned to different servers (p...
The implicit yes--vote commit protocol (IYV), proposed for future gigabit--networked distributed dat...
We introduce the concept of unreliable failure detectors and study how they can be used to solve Con...
International audienceWhile consensus is at the heart of many coordination problems in asynchronous ...
This paper presents a new atomic commitment protocol, Enhanced Three Phase Commit (E3PC ), that alw...
This paper presents a new atomic commitment protocol, enhanced three phase commit (E3PC ), that alw...
A quorum-based commit and termination protocol is designed with the goal of maintaining high data av...
Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site ...
An atomic commit protocol can cause long-term locking of databases if the coordinator crashes or bec...
Agreement problems allow a set of processes to agree on a common output value. These problems are of...
Agreement problems allow a set of processes to agree on a common output value. These problems are of...
In distributed transactional systems, an Atomic Commitment Protocol (ACP) is used to ensure the atom...
This paper describes a solution to the Atomic Broadcast problem in asynchronous distributed systems ...
We introduce the concept of unreliable failure detectors and study how they can be used to solve Con...
Abstract. This work introduces a highly modular derivation of fast non-blocking atomic commit protoc...
In a client-server architecture, replicated copies of an object are assigned to different servers (p...
The implicit yes--vote commit protocol (IYV), proposed for future gigabit--networked distributed dat...
We introduce the concept of unreliable failure detectors and study how they can be used to solve Con...
International audienceWhile consensus is at the heart of many coordination problems in asynchronous ...