On distributed algorithms in a broadcast domain

DOI10.1007/3-540-56939-1_87zbMath1418.68016OpenAlexW1840710833MaRDI QIDQ4630276

Danny Dolev, Dalia Malki

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_87

zbMATH Keywords

clock synchronizationmessage lossbroadcast messagebroadcast servicemembership change

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Necessary and sufficient conditions for broadcast consensus protocols.
• Reaching agreement on processor-group membership in synchronous distributed systems
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Using process groups to implement failure detection in asynchronous environments
• Observable clock synchronization extended abstract

This page was built for publication: On distributed algorithms in a broadcast domain