scientific article; zbMATH DE number 7561446

DOI10.4230/LIPIcs.OPODIS.2018.18MaRDI QIDQ5091092

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

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1805.01657

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominant strategiesmessage-passingfailuresasynchronous rounds

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items

Derivation of Heard-of Predicates from Elementary Behavioral Patterns

Cites Work

• A lower bound for the time to assure interactive consistency
• The Heard-Of model: computing in distributed systems with benign faults
• Round-by-round fault detectors (extended abstract)
• PSync: a partially synchronous language for fault-tolerant distributed algorithms
• The topological structure of asynchronous computability
• The weakest failure detector for solving consensus
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Towards a complexity theory for local distributed computing