Publication

Muteness Failure Detectors: Specification and Implementation

Rachid Guerraoui, André Schiper
1999
Conference Papers

Abstract

This paper extends the failure detector approach from crash-stop failures to muteness failures. Muteness failures are malicious failures in which a process stops sending algorithm messages, but might continue to send other messages, e.g., ``I am alive'' messages. The paper presents both the specification of a muteness failure detector, denoted ny M and an implementation of M in a partial synchrony model. We show that, modulo a simple modification, a consensus algorithm that has been designed in a crash-stop model with S, can be reused in the presence of muteness failures simply by replacing M with S.

Official source

https://infoscience.epfl.ch/entities/publication/c7fc5da7-a9d7-46dd-b365-c438e0fec814

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, André Schiper
1999
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/c7fc5da7-a9d7-46dd-b365-c438e0fec814

About this result

Related concepts (20)

Consensus (computer science)

A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. This often requires coordinating processes to reach consensus, or agree on some data value that is needed during computation. Example applications of consensus include agreeing on what transactions to commit to a database in which order, state machine replication, and atomic broadcasts.

Paper mill

A paper mill is a factory devoted to making paper from vegetable fibres such as wood pulp, old rags, and other ingredients. Prior to the invention and adoption of the Fourdrinier machine and other types of paper machine that use an endless belt, all paper in a paper mill was made by hand, one sheet at a time, by specialized laborers. History of paper Historical investigations into the origin of the paper mill are complicated by differing definitions and loose terminology from modern authors: Many modern scholars use the term to refer indiscriminately to all kinds of mills, whether powered by humans, by animals or by water.

Formal specification

In computer science, formal specifications are mathematically based techniques whose purpose are to help with the implementation of systems and software. They are used to describe a system, to analyze its behavior, and to aid in its design by verifying key properties of interest through rigorous and effective reasoning tools. These specifications are formal in the sense that they have a syntax, their semantics fall within one domain, and they are able to be used to infer useful information.

Related publications (2)

Muteness Failure Detectors: Specification and Implementation

Chat with Graph Search

Developing safe concurrent and distributed applications with an architectural environment

Formal testing of object-oriented software : from the method to the tool