Optimal gossiping in square meshes in all-port mode and with short packets

Authors:
Rui Wang;Francis C. M. Lau
Affiliations:
Department of Computer Science, The University of Hong Kong;Department of Computer Science, The University of Hong Kong
Venue:
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Year:
2005

Citing 11
Cited 1

Fast gossiping for the hypercube

SIAM Journal on Computing
Fast gossiping on square mesh computers

Information Processing Letters
Parallel Information Dissemination by Packets

SIAM Journal on Computing
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Optimal sequential gossiping by short messages

Discrete Applied Mathematics
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets

IEEE Transactions on Parallel and Distributed Systems
Networks, Routers and Transputers: Function, Performance and Applications

Networks, Routers and Transputers: Function, Performance and Applications
Fast Gossiping by Short Messages

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Optimal gossiping in paths and cycles

Journal of Discrete Algorithms

Optimal gossiping in square 2D meshes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present optimal solutions for the gossiping problem in square meshes under the all-port, full-duplex (F*) and the all-port, half-duplex (H*) models. We assume packets are of finite size, each carrying at most one message.