30 search results - page 5 / 6 » On k-Set Consensus Problems in Asynchronous Systems |
PDCAT
2009
Springer
14 years 2 months ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
SIAMCOMP
2000
13 years 7 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
PODC
1990
ACM
13 years 11 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...