Fast Information Sharing in a Complete Network

@article{Sunderam1993FastIS,
  title={Fast Information Sharing in a Complete Network},
  author={Vaidy S. Sunderam and Peter Winkler},
  journal={Discrete Applied Mathematics},
  year={1993},
  volume={42},
  pages={75-86}
}
Abstract We consider the problem of complete information dissemination among n autonomous processors in a fully connected distributed system. Initially, each processor possesses information not held by any other processor; it is required that all the processors obtain all the information in the shortest possible time. Messages are exchanged in discrete, synchronized rounds; message size is unlimited, but during a round, each processor may transmit messages to, or receive messages from, at most… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Agent-Based Distributed Computing for Dynamic Networks

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Gossiping and Broadcasting versus Computing Functions in Networks

  • Electronic Colloquium on Computational Complexity
  • 1996
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems

  • Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
  • 2006
VIEW 2 EXCERPTS
CITES BACKGROUND

Lower bounds on systolic gossip

  • Proceedings 11th International Parallel Processing Symposium
  • 1997

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Gossips and telegraphs

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Spreading information by conferences

  • Discrete Mathematics
  • 1976
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

New gossips and telephones

  • Discrete Mathematics
  • 1975
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Efficient decentralized consensus protocols in a distributed computing system

  • [1992] Proceedings of the 12th International Conference on Distributed Computing Systems
  • 1992

On Designing Efficient Consensus Protocols

A. A. Farrag, R. J. Dawson
  • Proc. IFIP WG 10.3 Working Conf. on Dist. Proc.,
  • 1987
VIEW 1 EXCERPT

On the minimal synchronism needed for distributed consensus

  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
VIEW 2 EXCERPTS