Sciweavers

75 search results - page 2 / 15
» Lower Bounds for Asynchronous Consensus
Sort
View
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 7 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 8 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
DC
2007
13 years 8 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
EDCC
2010
Springer
14 years 27 days ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
CPM
2005
Springer
75views Combinatorics» more  CPM 2005»
14 years 1 months ago
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
Brona Brejová, Daniel G. Brown, Ian M. Harr...