scientific article; zbMATH DE number 1760008

MaRDI QIDQ4536932zbMATH OpenFDO

Authors Michal Šoch, Pavel Tvrdík

Publication date 25 June 2002

zbMATH Keywords

2-D torusall-to-all broadcastgossipinterconnection networksstore-and-forwardtime-arc-disjoint broadcast trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Oblivious gossiping on tori
• Optimal algorithms for dissemination of information in some interconnection networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Optimal algorithms for dissemination of information in generalized communication modes
• Gossiping with multiple sends and receives

Cited in

(4)

• Faster gossiping on butterfly networks
• Optimal gossiping in square 2D meshes
• Oblivious gossiping on tori
• ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS

This page was built for publication:

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