Optimal gossiping in square 2D meshes

DOI10.1016/J.TCS.2007.04.032zbMath1125.68008OpenAlexW2130688380MaRDI QIDQ2382678

Yanyan Li

Publication date: 2 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.032

zbMATH Keywords

algorithmsnetworksgossipingmeshesinformation dissemination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized multipacket routing and sorting on meshes
• Data communication in parallel block predictor--corrector methods for solving ODE's
• Optimal sequential gossiping by short messages
• Fast gossiping on square mesh computers
• Methods and problems of communication in usual networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Optimal gossiping in paths and cycles
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Sequential information dissemination by packets
• Fast Gossiping by Short Messages
• Parallel Information Dissemination by Packets
• Structural Information and Communication Complexity

This page was built for publication: Optimal gossiping in square 2D meshes