Continuous consensus via common knowledge

DOI10.1007/s00446-007-0049-6zbMath1266.68040OpenAlexW1578764895MaRDI QIDQ1954252

Tal Mizrahi, Yoram Moses

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0049-6

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items

Coordinated consensus in dynamic networks ⋮ Error-free multi-valued consensus with byzantine failures ⋮ Distributed graph coloring in a few rounds ⋮ MIS on trees ⋮ Toward more localized local algorithms ⋮ The complexity of robust atomic storage ⋮ Resilience of mutual exclusion algorithms to transient memory faults ⋮ The impact of memory models on software reliability in multiprocessors ⋮ A complexity separation between the cache-coherent and distributed shared memory models ⋮ From bounded to unbounded concurrency objects and back ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Locally checkable proofs ⋮ Fault-tolerant spanners ⋮ Adaptively secure broadcast, revisited ⋮ Scalable rational secret sharing ⋮ Analyzing consistency properties for fun and profit ⋮ Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions ⋮ Optimal-time adaptive strong renaming, with applications to counting ⋮ The round complexity of distributed sorting ⋮ A tight unconditional lower bound on distributed randomwalk computation ⋮ Minimum congestion mapping in a cloud ⋮ Conflict on a communication channel ⋮ Stability of a peer-to-peer communication system ⋮ Tight bounds on information dissemination in sparse mobile networks ⋮ Time-efficient randomized multiple-message broadcast in radio networks ⋮ Faster information dissemination in dynamic networks via network coding ⋮ No double discount: condition-based simultaneity yields limited gain ⋮ Unnamed Item ⋮ Order optimal information spreading using algebraic gossip ⋮ Continuous Consensus with Failures and Recoveries ⋮ No Double Discount: Condition-Based Simultaneity Yields Limited Gain ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Structuring unreliable radio networks ⋮ Continuous consensus with ambiguous failures ⋮ Byzantine agreement with homonyms ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Compact policy routing ⋮ Xheal

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• The Esterel synchronous programming language: Design, semantics, implementation
• Common knowledge and consistent simultaneous coordination
• Knowledge and common knowledge in a distributed environment
• The Distributed Firing Squad Problem

This page was built for publication: Continuous consensus via common knowledge