Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs (Extended Abstract) (1993)
| Venue: | Information and Computation |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Hromkovic93gossipingin,
author = {Juraj Hromkovic and Ralf Klasing and Elena A. Stohr and Hubert Wagener},
title = {Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs (Extended Abstract)},
booktitle = {Information and Computation},
year = {1993},
pages = {200--211},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Juraj Hromkovic y , Ralf Klasing, Elena A. Stohr, Hubert Wagener z Department of Mathematics and Computer Science University of Paderborn, 33095 Paderborn, Germany Abstract The communication modes (one-way and two-way mode) used for sending messages to processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following: 1. Effective one-way and two-way gossip algorithms for d-dimensional grids, d 2, are designed. 2. The lower bound 2 log 2 n \Gamma log 2 k \Gamma log 2 log 2 n \Gamma 2 is established on the number of rounds of every two-way gossip algorithm working on any graph of n nodes and vertex bisection k. This proves that the designed two-way gossip algorithms on d-dimensional grids, d 3, are almost optimal, and it al...
