Brief announcement: the minimum failure detector for non-local tasks in message-passing systems

Authors:
Carole Delporte-Gallet;Hugues Fauconnier;Sam Toueg
Affiliations:
LIAFA, University Paris Diderot, France;LIAFA, University Paris Diderot, France;University of Toronto, ON, Canada
Venue:
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Year:
2009

Citing 2
Cited 0

A combinatorial characterization of the distributed 1-solvable tasks

Journal of Algorithms
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-passing systems. It also introduces a natural weakening of the well-known set agreement task, and show that, in some precise sense, it is the weakest non-local task in message-passing systems.