Improved gossipings by short messages in 2-dimensional meshes

Authors:
Jae-Hoon Kim;Jae-Ha Lee;Kyung-Yong Chwa
Affiliations:
Department of Computer Science, KAIST, Kusong-dong 373-1, Yusong-gu, Taejon 305-701, Republic of Korea;Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, Geb. 46.1 666123 Saarbrücken, Germany;Department of Computer Science, KAIST, Kusong-dong 373-1, Yusong-gu, Taejon 305-701, Republic of Korea
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 6
Cited 0

Optimal communication algorithms for hypercubes

Journal of Parallel and Distributed Computing
Fast gossiping on square mesh computers

Information Processing Letters
Parallel Information Dissemination by Packets

SIAM Journal on Computing
Fast Gossiping by Short Messages

SIAM Journal on Computing
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes

IEEE Transactions on Parallel and Distributed Systems
Communication Complexity of Gossiping by Packets

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses gossiping problems in two-dimensional meshes under two different models: one-port telephone model and full-port model. It is assumed in both models that only one packet can be transmitted through each link at one time step. Our algorithms are based on very similar ideas and improve on the previous results in (SIAM J. Comput. 27 (1998) 917; IEEE Trans. Parallel Distrib. Systems 10(12) (1999) 1252), respectively.