35 search results - page 4 / 7 » A New Algorithm to Solve Synchronous Consensus for Dependent... |
PDP
2002
IEEE
14 years 10 days 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...
EDCC
2005
Springer
14 years 29 days ago
2005
Springer
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security mo...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
WDAG
1997
Springer
13 years 11 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...