scientific article; zbMATH DE number 7407798

MaRDI QIDQ5155689zbMATH OpenFDO

Authors Adam Shimi, Aurélie Hurault, Philippe Quéinnec

Publication date 8 October 2021

Full work available at URL https://arxiv.org/abs/2011.12879, https://lmcs.episciences.org/8496

zbMATH Keywords

asynchronous roundsfailuresheard-of modelmessage-passing models

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 4001466
• Characterizing asynchronous message-passing models through rounds
• scientific article; zbMATH DE number 1104400
• Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach
• On the completeness of verifying message passing programs under bounded asynchrony
• scientific article; zbMATH DE number 1903352
• scientific article; zbMATH DE number 1497813
• Mathematical Foundations of Computer Science 2005
• About the Termination Detection in the Asynchronous Message Passing Model

Cites work

• \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
• A characterization of oblivious message adversaries for which consensus is solvable
• A lower bound for the time to assure interactive consistency
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Asynchronous message orderings beyond causality
• Cutoff bounds for consensus algorithms
• Decomposition of distributed programs into communication-closed layers
• Derivation of heard-of predicates from elementary behavioral patterns
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The complexity of data aggregation in directed networks
• The Heard-Of model: computing in distributed systems with benign faults
• The topological structure of asynchronous computability
• The weakest failure detector for solving consensus
• Time is not a healer (preliminary version)
• Topological Characterization of Consensus under General Message Adversaries
• Towards a complexity theory for local distributed computing
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Cited in

(3)

• scientific article; zbMATH DE number 4001466 (Why is no real title available?)
• Derivation of heard-of predicates from elementary behavioral patterns
• Characterizing asynchronous message-passing models through rounds

Describes a project that uses

Uses Software

• PSync

This page was built for publication:

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