The multiplicative power of consensus numbers

  title={The multiplicative power of consensus numbers},
  author={Damien Imbs and Michel Raynal},
  journal={Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing},
  • Damien Imbs, M. Raynal
  • Published 25 July 2010
  • Computer Science
  • Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom. Said in another way, the BG simulation shows that the crucial parameter is not the number n of processes but the upper bound t on the number of processes that are allowed to crash. The BG algorithm considers colorless decision tasks in the base read/write shared memory model. (Colorless means that if, process decides a… 

Figures from this paper

Byzantine BG Simulations for Message-Passing Systems
This paper focuses on BG-like simulations in the context of asynchronous message-passing systems, and incrementally presents two reductions that consider that processes may fail by crashing, and is the first BG simulation algorithm that considers Byzantine process failures.
From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach
The BG simulation is extended to message-passing systems and failures more severe than process crashes, being modular and direct, and provides a deeper insight in the nature and understanding of crash and Byzantine failures in the context of asynchronous message- passing systems.
236358-Topology in distributed computing Final project : black box x-consensus objects
In [2], the authors have shown that the read-write shared memory model with x-consensus objects and at most t failures has equivalent power to any other model with x′-consensus objects and t′
Power and limits of distributed computing shared memory models
Simulations and reductions for colorless tasks
This work gives a definition, expressed in the language of combinatorial topology, for what it means for one model of distributed computation to simulate another with respect to the ability to solve colorless tasks and shows how to exploit elementary topological arguments to show when a simulation exists.
Untangling Partial Agreement: Iterated x-consensus Simulations
The task computability equivalence is extended further by presenting a simulation that includes x-consensus objects, which solve consensus among up to x processes, which implies that an iterated model where processes communicate through a sequence consisting only of x- Consensus objects is equivalent to the basic shared memory model augmented with x-Consensus objects.
Generalizing State Machine Replication ( Preliminary Version )
We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to
Generalizing State Machine Replication
We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to
On the Classification of Deterministic Objects via Set Agreement Power
It is shown that in any system with n > 2 processes, there is a deterministic wait-free object that is not equivalent to anyWait-free task.


Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
The core of an extended BG simulation algorithm that is particularly simple is presented, based on the base agreement object used in the BG simulation, and a new simple object that is called arbiter that is used to ensure that the permanent blocking of any of these t + 1 simulated processes can only be due to the crash of its owner simulator.
The extended BG-simulation and the characterization of t-resiliency
The Borowsky-Gafni (BG) simulation is amended to result in the Extended-BG-simulation, an extension that yields a full characterization of t-resilient solvability, demonstrating the convenience that the characterization provides and proving a new equivalence result.
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
It is shown that for any k<n, there is no deterministic wait-free protocol for n processors that solves the k-set agreement problem, and a topological structure is revealed that reveals a close analogy between the impossibility ofWait-free k- set agreement and the Brouwer fixed point theorem for thek-dimensional ball.
Generalized FLP impossibility result for t-resilient asynchronous computations
This paper generalizes FLP to multiple faults and establishes that k-set consensus proposed by Chaudhuri is impossible, if the protocol is to tolerate k failures, while there exists a protocol that tolerates k – 1 failures.
The BG distributed simulation algorithm
A shared memory algorithm that allows a set of f+1 processes to wait-free “simulate” a larger system of n processes, that may also exhibit up to f stopping failures, satisfies the requirements of a fault-tolerant distributed simulation.
Failure detectors as type boosters
This paper addresses the question of the weakest failure detector to solve consensus among a number k > n of processes that communicate using shared objects of a type T with consensus power n and shows that Ωn is necessary and also the weakest to boost the power of (n + 1)-ported one-shot deterministic types from n to any k < n.
On set consensus numbers
It is shown that any FD that solves a colorless task that cannot be solved read-write k-resiliently, also solves k-set consensus and determines the weakest FD for solving k- set consensus in every environment.
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability
An important issue in fault-tolerant asynchronous computing is the respective power of an object type with respect to another object type. This question has received a lot of attention, mainly in the
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems
It is proved using a combinatorial argument that any k-resilient protocol for the k-set agreement problem would satisfy the uncertainty condition, while this is not true for any (k−1)-resilients in a totally asynchronous system.