Lower bounds on systolic gossip

DOI10.1016/j.ic.2004.09.002zbMath1105.68006MaRDI QIDQ1763428

Stéphane Pérennes, Michele Flammini

Publication date: 22 February 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.09.002

zbMATH Keywords

gossiping; systolic protocols

Mathematics Subject Classification ID

68M14: Distributed systems

68M12: Network protocols

Related Items

On the complexity of bandwidth allocation in radio networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast information sharing in a complete network
• Methods and problems of communication in usual networks
• Broadcasting in butterfly and deBruijn networks
• Traffic-light scheduling on the grid
• Periodic gossiping on trees
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• On the Optimality of General Lower Bounds for Broadcasting and Gossiping
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• Broadcasting in Bounded Degree Graphs
• Gossiping in Minimal Time
• The complexity of systolic dissemination of information in interconnection networks
• Effective systolic algorithms for gossiping in cycles and two-dimensional grids