Communication in the two-way listen-in vertex-disjoint paths mode

DOI10.1016/S0304-3975(00)00214-0zbMath0972.68008OpenAlexW1983174539MaRDI QIDQ5941562

Hans-Joachim Böckenhauer

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00214-0

zbMATH Keywords

communication algorithmsparallel computations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal algorithms for dissemination of information in generalized communication modes
• Methods and problems of communication in usual networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Minimum-time multidrop broadcast
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Fast algorithms for bit-serial routing on a hypercube
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Virtual cut-through: A new computer communication switching technique
• On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: Communication in the two-way listen-in vertex-disjoint paths mode