Effective systolic algorithms for gossiping in cycles and two-dimensional grids

DOI10.1007/3-540-60249-6_59OpenAlexW135052881MaRDI QIDQ5055899FDOQ5055899

Authors Juraj Hromkovič, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60249-6_59

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• The complexity of systolic dissemination of information in interconnection networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Optimal algorithms for dissemination of information in some interconnection networks

Cites work

• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• scientific article; zbMATH DE number 3692664 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Methods and problems of communication in usual networks
• Note on optimal gossiping in some weak-connected graphs
• On real-time cellular automata and trellis automata
• Parallel algorithms for gossiping by mail
• Periodic gossiping on trees
• Systolic automata for VLSI on balanced trees
• Systolic trellis automatata †
• The complexity of systolic dissemination of information in interconnection networks
• Traffic-light scheduling on the grid

Cited in

(2)

• Note on the problem of gossiping in multidimensional grids
• Lower bounds on systolic gossip

This page was built for publication: Effective systolic algorithms for gossiping in cycles and two-dimensional grids

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