Optimal broadcast for fully connected processor-node networks

DOI10.1016/J.JPDC.2007.12.001zbMath1243.68033OpenAlexW2062810083MaRDI QIDQ436809

Jesper Larsson Träff, Andreas Ripke

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.12.001

zbMATH Keywords

broadcastmessage passing interface (MPI)bidirectional communication modelfully connected communication networkSMP cluster

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (1)

Scalability limits of Bag-of-Tasks applications running on hierarchical platforms

Uses Software

• MPI

Cites Work

• A bandwidth latency tradeoff for broadcast and reduction
• Optimal and near-optimal algorithms for \(k\)-item broadcast
• Broadcasting multiple messages in simultaneous send/receive systems
• Methods and problems of communication in usual networks
• Optimal multiple message broadcasting in telephone-like communication systems
• A survey of gossiping and broadcasting in communication networks
• Designing broadcasting algorithms in the postal model for message-passing systems
• Multiple message broadcasting in communication networks
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Optimal broadcast for fully connected processor-node networks