Sciweavers

75 search results - page 6 / 15
» Lower Bounds for Asynchronous Consensus
Sort
View
PODC
2003
ACM
14 years 1 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
OPODIS
2007
13 years 9 months ago
Byzantine Consensus with Few Synchronous Links
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
Moumen Hamouma, Achour Mostéfaoui, Gilles T...
CAV
2001
Springer
154views Hardware» more  CAV 2001»
13 years 11 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
13 years 6 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
EUC
2007
Springer
14 years 2 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...