Fast gossiping on square mesh computers

DOI10.1016/0020-0190(93)90254-7zbMath0787.68042OpenAlexW2074682222MaRDI QIDQ1313753

Masafumi Yamashita, Satoshi Fujita

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

parallel algorithmsgossipingoptimal time boundssquare mesh computers

Mathematics Subject Classification ID

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

Related Items (3)

Methods and problems of communication in usual networks ⋮ Optimal gossiping in square 2D meshes ⋮ Optimal gossiping in paths and cycles

Cites Work

• Unnamed Item
• Parallel algorithms for gossiping by mail
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time

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