806 search results - page 74 / 162 » Lower Bounds on Correction Networks |
140
click to vote
PODC
2006
ACM
16 years 4 hour ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
160
click to vote
SIROCCO
2003
15 years 7 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
151
click to vote
EUC
2007
Springer
16 years 6 days ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
168
click to vote
INFOCOM
2009
IEEE
16 years 21 days ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
144
click to vote
CISS
2008
IEEE
16 years 15 days ago
2008
IEEE
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...