Sciweavers

83 search results - page 14 / 17
» Consensus in byzantine asynchronous systems
Sort
View
CONCUR
2009
Springer
13 years 5 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
PODC
2010
ACM
13 years 11 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
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...
Seth Gilbert, Dariusz Kowalski
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 7 months ago
On Quiescent Reliable Communication
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...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
HICSS
2008
IEEE
111views Biometrics» more  HICSS 2008»
14 years 1 months ago
Participant-Driven Collaborative Convergence
Traditional GSS workflow leverages the abilities of an expert facilitator to lead groups through the convergence activities. This dependence on a facilitator creates a bottleneck ...
Joel H. Helquist, John Kruse, Mark Adkins