22 search results - page 4 / 5 » Asynchronous Byzantine consensus with 2f 1 processes |
SIAMCOMP
2008
13 years 4 months ago
2008
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 ...
ICFEM
2009
Springer
14 years 24 days ago
2009
Springer
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
WDAG
2007
Springer
14 years 11 days 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,...
SSS
2009
Springer
14 years 24 days ago
2009
Springer
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
WDAG
1997
Springer
13 years 10 months ago
1997
Springer
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...