Periodic gossiping in commuted networks

DOI10.1007/S00224-004-1197-8zbMATH Open1088.68012OpenAlexW2059170436MaRDI QIDQ705134FDOQ705134

Authors D. Barth, Pascal Berthomé

Publication date 25 January 2005

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-004-1197-8

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Periodic gossiping on trees
• Faster gossiping on butterfly networks
• Gossiping with multiple sends and receives
• Fast Gossiping by Short Messages
• Optimal algorithms for dissemination of information in some interconnection networks

Cited in

(1)

• Cayley graphs as classifiers for data mining: the influence of asymmetries

This page was built for publication: Periodic gossiping in commuted networks

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