Sciweavers

256 search results - page 1 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
WDAG
2001
Springer
104views Algorithms» more  WDAG 2001»
13 years 10 months ago
A New Synchronous Lower Bound for Set Agreement
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 6 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
FOCS
1993
IEEE
13 years 10 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 23 days ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
SIAMCOMP
2011
13 years 1 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon