Oblivious gossiping on tori

Authors:
Ulrich Meyer;Jop F. Sibeyn
Affiliations:
Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany;Department of Computing Science, Faculty of Science and Technology, Umeå University, 90187 Umeå Sweden
Venue:
Journal of Algorithms
Year:
2002

Citing 14
Cited 1

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Optimal total exchange for a 3-D torus of processors

Information Processing Letters
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
k-k routing, k-k sorting, and cut-through routing on the mesh

Journal of Algorithms
Circuit-Switched Broadcasting in Torus Networks

IEEE Transactions on Parallel and Distributed Systems
An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks

IEEE Transactions on Parallel and Distributed Systems
Gossiping on Meshes and Tori

IEEE Transactions on Parallel and Distributed Systems
All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes

IEEE Transactions on Parallel and Distributed Systems
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Circuit-Switched Gossiping in 3-Dimensional Torus Networks

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Structured communication in torus networks

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks

HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture

A generic theoretical framework for modeling gossip-based algorithms

ACM SIGOPS Operating Systems Review - Gossip-based computer networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the processing units in our algorithm forward the received packets always in the same way. We thus achieve almost the same performance with patterns that might be hardwired.