Conditions on input vectors for consensus solvability in asynchronous distributed systems
From MaRDI portal
Publication:3452512
DOI10.1145/950620.950624zbMath1325.68035OpenAlexW2021482754MaRDI QIDQ3452512
Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal
Publication date: 12 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/950620.950624
fault-toleranceasynchronous systemsshared memoryatomic registersconsensus problemcrash failuresmessage-passing
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (16)
Synchronous condition-based consensus ⋮ On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems ⋮ Communication Patterns and Input Patterns in Distributed Computing ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Power and limits of distributed computing shared memory models ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ No double discount: condition-based simultaneity yields limited gain ⋮ On the Validity of Consensus ⋮ No Double Discount: Condition-Based Simultaneity Yields Limited Gain ⋮ What Can be Computed in a Distributed System? ⋮ An impossibility about failure detectors in the iterated immediate snapshot model ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
This page was built for publication: Conditions on input vectors for consensus solvability in asynchronous distributed systems