Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
Information and Computation
Parallel programming with MPI
Gossip in Trees under Line-Communication Mode
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
| Hi-index | 5.23 |
This paper is devoted to the gossip (or all-to-all) problem in the chordal ring under the one-port line model. The line model assumes long distance calls between non-neighboring processors. In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength division multiplexing, ATM switching, and networks supporting connected mode routing protocols. Since the chordal rings are competitors of networks as meshes or tori because of their short diameter and bounded degree, it is of interest to ask whether they can support intensive communications (typically all-to-all) as efficiently as these networks. We propose polynomial algorithms to derive optimal or near-optimal gossip protocols in the chordal ring.