Publication

Finally the Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui, Petr Kouznetsov
2003
Reports

Abstract

Recent papers [GK03,HT03] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize the result by presenting the weakest failure detector to solve NBAC in any environment, i.e., without any assumption on the number of processes that can crash. We present the result in a modular manner through determining the weakest failure detector for quittable consensus, a variant of consensus introduced by Hadzilacos and Toueg [HT03].

Official source

https://infoscience.epfl.ch/entities/publication/0d83b074-003c-4a42-afc0-8fa7cff0635a

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Rachid Guerraoui, Petr Kouznetsov
2003
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/0d83b074-003c-4a42-afc0-8fa7cff0635a

About this result

Related concepts (11)

Two-phase commit protocol

In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP). It is a distributed algorithm that coordinates all the processes that participate in a distributed atomic transaction on whether to commit or abort (roll back) the transaction. This protocol (a specialised type of consensus protocol) achieves its goal even in many cases of temporary system failure (involving either process, network node, communication, etc.

Concurrency control

In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency control ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible. Computer systems, both software and hardware, consist of modules, or components. Each component is designed to operate correctly, i.e., to obey or to meet certain consistency rules.

Commitment ordering

Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related applications. It allows optimistic (non-blocking) implementations. With the proliferation of multi-core processors, CO has also been increasingly utilized in concurrent programming, transactional memory, and software transactional memory (STM) to achieve serializability optimistically. CO is also the name of the resulting transaction schedule (history) property, defined in 1988 with the name dynamic atomicity.

Related publications (4)

Finally the Weakest Failure Detector for Non-Blocking Atomic Commit

Chat with Graph Search

Comparing Atomic Broadcast Algorithms in High Latency Networks

The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit

Shared Memory vs Message Passing