83 search results - page 15 / 17 » Consensus in byzantine asynchronous systems |
INFORMATICALT
2006
14 years 9 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
PODC
1990
ACM
15 years 1 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...
187
click to vote
PADL
2009
Springer
15 years 10 months ago
2009
Springer
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
130
click to vote
PODC
2011
ACM
14 years 8 days ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
82
Voted
PDP
2002
IEEE
15 years 2 months ago
2002
IEEE
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...