Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

DOI10.1137/S0097539793252870MaRDI QIDQ4714557zbMATH OpenOpenAlexFDO

Authors Satoshi Fujita, Masafumi Yamashita

Publication date 21 April 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793252870

zbMATH Keywords

algorithmsbroadcastingcircuit-switching modelgroup gossipinghypercuberouting problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Fast Gossiping for the Hypercube
• An efficient algorithm for multiple simultaneous broadcasts in the hypercube
• Optimal algorithms for dissemination of information in some interconnection networks
• Gossiping with multiple sends and receives

Cited in

(5)

• Optimal gossiping in paths and cycles
• Optimal serial broadcast of successive chunks
• A \(\sqrt {N \over G}\) method for generating communication
• Fast Gossiping for the Hypercube
• An online distributed gossiping protocol for mobile networks

This page was built for publication: Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

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