The minimum information about failures for solving non-local tasks in message-passing systems

DOI10.1007/S00446-011-0146-4MaRDI QIDQ661069zbMATH OpenOpenAlexFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg

Publication date 6 February 2012

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-011-0146-4

zbMATH Keywords

fault-toleranceset agreementfailure detectorsdistributed taskslocal tasks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• On the weakest failure detector ever
• On Set Consensus Numbers
• On the weakest failure detector ever
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• On the road to the weakest failure detector for k-set agreement in message-passing systems

Cites work

• scientific article; zbMATH DE number 3819094 (Why is no real title available?)
• A combinatorial characterization of the distributed 1-solvable tasks
• A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
• Anti-\(\Omega \): the weakest failure detector for set agreement
• Automatic Classification of Eventual Failure Detectors
• Every problem has a weakest failure detector
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Mutual exclusion in asynchronous systems with failure detectors
• On the weakest failure detector ever
• The Weakest Failure Detector for Message Passing Set-Agreement
• The minimum information about failures for solving non-local tasks in message-passing systems
• The topological structure of asynchronous computability
• The weakest failure detector for solving consensus
• The weakest failure detectors to boost obstruction-freedom
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• Tight failure detection bounds on atomic object implementations
• Unreliable failure detectors for reliable distributed systems
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Cited in

(3)

• The minimum information about failures for solving non-local tasks in message-passing systems
• What can be computed in a distributed system?
• Perfect failure detection with very few bits

This page was built for publication: The minimum information about failures for solving non-local tasks in message-passing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661069)