Worm-Hole Gossiping on Meshes


Several algorithms for performing gossiping on one-and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays, we give a novel lower bound and an asymptotically optimal gossiping algorithm. For two-dimensional meshes, we present a simple algorithm composed of one… (More)
DOI: 10.1007/3-540-61626-8_47


Cite this paper

@inproceedings{Juurlink1996WormHoleGO, title={Worm-Hole Gossiping on Meshes}, author={Ben H. H. Juurlink and P. S. Rao and Jop F. Sibeyn}, booktitle={Euro-Par, Vol. I}, year={1996} }