Fast gossiping on square mesh computers

DOI10.1016/0020-0190(93)90254-7MaRDI QIDQ1313753zbMATH OpenOpenAlexFDO

Authors Satoshi Fujita, Masafumi Yamashita

Publication date 26 May 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90254-7

zbMATH Keywords

gossipingoptimal time boundsparallel algorithmssquare mesh computers

Mathematics Subject Classification ID

General theory of computer systems (68M01) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Recommendations

• Optimal gossiping in square 2D meshes
• Fast gossiping on mesh-bus computers
• Structural Information and Communication Complexity
• Fast Gossiping for the Hypercube
• Improved gossipings by short messages in 2-dimensional meshes

Cites work

• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• scientific article; zbMATH DE number 49799 (Why is no real title available?)
• Parallel algorithms for gossiping by mail

Cited in

(7)

• Methods and problems of communication in usual networks
• Optimal gossiping in paths and cycles
• Optimal gossiping in square 2D meshes
• ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS
• Fast gossiping on mesh-bus computers
• Improved gossipings by short messages in 2-dimensional meshes
• Structural Information and Communication Complexity

This page was built for publication: Fast gossiping on square mesh computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313753)