On the Influence of Graph Density on Randomized Gossiping

@article{Elssser2015OnTI,
  title={On the Influence of Graph Density on Randomized Gossiping},
  author={Robert Els{\"a}sser and Dominik Kaaser},
  journal={2015 IEEE International Parallel and Distributed Processing Symposium},
  year={2015},
  pages={521-531}
}
Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, known as the broadcasting problem, a single message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the socalled random phone call model (Karp et al., FOCS 2000). In each step, every node opens a communication channel to a randomly chosen neighbor, which can then be used for bidirectional communication. Motivated by… CONTINUE READING

Similar Papers

Loading similar papers…