Publication

The Weakest Failure Detector for Message Passing Set-Agreement

Rachid Guerraoui
2008
Conference Papers

Abstract

In the set-agreement problem, n processes seek to agree on at most n−1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Loneliness detector and denoted L, outputs one of two values, “true” or “false” such that: (1) there is at least one process where L outputs always “false”, and (2) if only one process is correct, L eventually outputs “true” at this process.

Official source

https://infoscience.epfl.ch/entities/publication/61b575e8-d647-4d38-9214-9b1b54b0df28

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.

The Weakest Failure Detector for Message Passing Set-Agreement

Chat with Graph Search

The Two Times Problem: Where Is the Problem?

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

ACACIA: a new method to produce on-the-fly merger trees in the RAMSES code