7133 search results - page 405 / 1427 » Communication algorithms with advice |
245
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
193
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
176
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
148
click to vote
FPL
2007
Springer
16 years 1 months ago
2007
Springer
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus...
132
click to vote
GLOBECOM
2006
IEEE
16 years 26 days ago
2006
IEEE
— We present a new timeout algorithm for TCP, based on the observation that TCP-RTO should not be solely based on RTT estimations. We argue that the design principles of the curr...