83 search results - page 16 / 17 » Consensus in byzantine asynchronous systems |
WDAG
2007
Springer
14 years 1 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,...
WDAG
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
ICDCS
2006
IEEE
14 years 6 min ago
2006
IEEE
Content-based publish/subscribe (pub/sub) is a promising paradigm for building asynchronous distributed applications. In many application scenarios, these systems are required to ...
EDCC
2005
Springer
13 years 11 months ago
2005
Springer
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
SSS
2009
Springer
14 years 14 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 ...