Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Tolerating a linear number of faults in networks of bounded degree
Information and Computation
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Distributed Cooperation During the Absence of Communication
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A robust randomized algorithm to perform independent tasks
Journal of Discrete Algorithms
Gossiping by processors prone to omission failures
Information Processing Letters
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing
A gossip-based protocol to reach consensus via uninorm aggregation operator
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
To reach consensus using uninorm aggregation operator: A gossip-based protocol
International Journal of Intelligent Systems
Journal of the ACM (JACM)
Hi-index | 5.23 |
This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2p) and message complexity M = O(p1+ε), for any ε 0. This substantially improves the message complexity of the previous best algorithm that has M = O(p1.77), while maintaining the same time complexity.The strength and utility of the new result is demonstrated by constructing a deterministic algorithm for performing n tasks in this distributed setting. Previous solutions used coordinator or checkpointing approaches, immediately incurring a work penalty Ω(n + f ċ p) for f crashes, or relied on strong communication primitives, such as reliable broadcast, or had work too close to the trivial Θ(p ċ n) bound of oblivious algorithms. The new algorithm uses p crash-prone processors to perform n similar and idempotent tasks so long as one processor remains active. The work of the algorithm is W = O(n + p ċ min{f + 1, log3p}) and its message complexity is M = O(fpepsiv; + p min{f + 1, log p}), for any ε 0. This substantially improves the work complexity of previous solutions using simple point-to-point messaging, while "meeting or beating" the corresponding message complexity bounds.The new algorithms use communication graphs and permutations with certain combinatorial properties that are shown to exist. The algorithms are correct for any permutations, and in particular, the same expected bounds can be achieved using random permutations.