75 search results - page 12 / 15 » Lower Bounds for Asynchronous Consensus |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
RSA
1998
13 years 7 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
ICCAD
2010
IEEE
13 years 6 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...