Telephone problems with failures
SIAM Journal on Algebraic and Discrete Methods
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Fault tolerance in networks of bounded degree
SIAM Journal on Computing
Fast gossiping with short unreliable messages
Proceedings of the international workshop on Broadcasting and gossiping 1990
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Tolerating a linear number of faults in networks of bounded degree
Information and Computation
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Explicit Combinatorial Structures for Cooperative Distributed Algorithms
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Efficient gossip and robust distributed computation
Theoretical Computer Science
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Gossiping by processors prone to omission failures
Information Processing Letters
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
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
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
To reach consensus using uninorm aggregation operator: A gossip-based protocol
International Journal of Intelligent Systems
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Journal of the ACM (JACM)
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t