Dissecting distributed coordination

DOI10.1007/BFB0022141MaRDI QIDQ6062520zbMATH OpenFDO

Authors Aleta Ricciardi

Publication date 1 December 2023

Published in Distributed Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0022141

Mathematics Subject Classification ID

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

Recommendations

• A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
• Impossibility of distributed consensus with one faulty process
• EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST
• Easy impossibility proofs for distributed consensus problems
• Unreliable failure detectors for reliable distributed systems

Cites work

• How processes learn
• Impossibility of distributed consensus with one faulty process
• Knowledge and common knowledge in a distributed environment
• The Byzantine Generals Problem
• The weakest failure detector for solving consensus
• Time, clocks, and the ordering of events in a distributed system
• Uniform actions in asynchronous distributed systems
• Using process groups to implement failure detection in asynchronous environments

Cited in

(6)

• scientific article; zbMATH DE number 1286204 (Why is no real title available?)
• scientific article; zbMATH DE number 1950676 (Why is no real title available?)
• scientific article; zbMATH DE number 1497796 (Why is no real title available?)
• Separating computation, coordination and configuration
• On the Value of Coordination in Distributed Decision Making
• Distributed disassembly of mosaics

This page was built for publication: Dissecting distributed coordination

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