Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors

DOI10.1145/2484239.2484249zbMath1323.68046OpenAlexW1967721311MaRDI QIDQ5176092

Julien Stainer, Michel Raynal

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484249

zbMATH Keywords

simulationtournamentquorumasynchronous systemsynchronous systemwait-freedomdistributed computabilityfailure detectorprocess crashmodel equivalencemessage-passing modelmessage adversaryread/write model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (8)

Asynchronous Byzantine reliable broadcast with a message adversary ⋮ A simple characterization of asynchronous computations ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ What Can be Computed in a Distributed System? ⋮ Consensus in rooted dynamic networks with short-lived stability ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Characterizing Consensus in the Heard-Of Model ⋮ A characterization of oblivious message adversaries for which consensus is solvable

This page was built for publication: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors