Publication

On the Weakest Failure Detector for Non-Blocking Atomic Commit.

Rachid Guerraoui, Petr Kouznetsov
2002
Reports

Abstract

This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes detectors that provide information about global time but includes all known meaningful failure detectors such as P and P [CT96]. We show that, within A, the weakest failure detector for NBAC is ?P+S.

Official source

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
2002
Reports

Abstract

Official source

Related concepts (16)

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.

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.

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.

Related publications (8)

On the Weakest Failure Detector for Non-Blocking Atomic Commit.

Chat with Graph Search

Accompanying dataset for the paper: "Adaptive FEM-DEM bridging coupling to study third-body evolution in sheared granular media"

Contributions

Funding sources

Data structure and information

Mise en place expérimentale d’un chatbot à vocation interne basé sur l’IA

Implicit Human Centered Tagging