Publication

Tight Failure Detection Bounds on Atomic Object Implementations

Rachid Guerraoui
2010
Journal Articles

Abstract

This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.

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.

Tight Failure Detection Bounds on Atomic Object Implementations

Chat with Graph Search

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

A paradox of eventual linearizability in shared memory

The Complexity of Renaming