Sciweavers

75 search results - page 4 / 15
» Lower Bounds for Asynchronous Consensus
Sort
View
CDC
2010
IEEE
150views Control Systems» more  CDC 2010»
14 years 5 months ago
Consensus on asynchronous communication networks in presence of external input
This paper presents a class of multi-agent systems where the state of each agent is driven by its own local protocol, and by exogenous time-varying input signal. These inputs may r...
C. Pilotto, K. M. Chandy, J. White
JACM
2008
90views more  JACM 2008»
14 years 10 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 4 months ago
Rate of Convergence for Consensus with Delays
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
Pierre-Alexandre Bliman, Angelia Nedic, Asuman E. ...
FOSSACS
2007
Springer
15 years 4 months ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz
PODC
2004
ACM
15 years 3 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...