30 search results - page 3 / 6 » On k-Set Consensus Problems in Asynchronous Systems |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...
SIAMCOMP
2002
13 years 7 months ago
2002
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...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
EDCC
2010
Springer
14 years 8 days ago
2010
Springer
: 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...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
: 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....