The notion of veto number for distributed agreement problems

Authors:
Roy Friedman;Achour Mostefaoui;Michel Raynal
Affiliations:
Computer Science Department, Technion, Haifa, Israel;IRISA, Rennes, France;IRISA, Rennes, France
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 9
Cited 1

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors

IEEE Transactions on Parallel and Distributed Systems
Failure Detection Lower Bounds on Registers and Consensus

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems

Journal of the ACM (JACM)
Non-blocking atomic commit in asynchronous distributed systems with failure detectors

Distributed Computing
A weakest failure detector-based asynchronous consensus protocol for f

Information Processing Letters

Managed Agreement: Generalizing two fundamental distributed agreement problems

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the notion of veto number that can be associated with agreement problems. An agreement problem has veto number ℓ when ℓ is the minimal number of processes that control the allowed decision values, i.e., if each of them changes its mind on the value it proposes, then it forces deciding on a different value. The paper presents and investigates this concept.