Sciweavers

5 search results - page 1 / 1
» Conditions on input vectors for consensus solvability in asy...
Sort
View
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 5 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
PODC
1999
ACM
13 years 9 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 5 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
PODC
1997
ACM
13 years 9 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
13 years 3 months ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...