75 search results - page 10 / 15 » Lower Bounds for Asynchronous Consensus |
FUN
2010
Springer
14 years 27 days ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
JPDC
2006
13 years 8 months ago
2006
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
PODC
2011
ACM
12 years 11 months 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...
SIAMCO
2010
13 years 2 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...