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
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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cites Work
- A survey of gossiping and broadcasting in communication networks
- Methods and problems of communication in usual networks
- Title not available (Why is that?)
- Systolic trellis automatata †
- Gossiping in Minimal Time
- On real-time cellular automata and trellis automata
- Systolic automata for VLSI on balanced trees
- Title not available (Why is that?)
- Parallel algorithms for gossiping by mail
- The complexity of systolic dissemination of information in interconnection networks
- Title not available (Why is that?)
- Note on optimal gossiping in some weak-connected graphs
- Traffic-light scheduling on the grid
- Periodic gossiping on trees
Cited In (2)
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)
