Optimal broadcast for fully connected processor-node networks

DOI10.1016/J.JPDC.2007.12.001MaRDI QIDQ436809zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A bandwidth latency tradeoff for broadcast and reduction
• Optimal multiple message broadcasting in telephone-like communication systems
• Bandwidth efficient all-to-all broadcast on switched clusters
• Broadcasting in wraparound meshes with parallel monodirectional links
• Optimal and near-optimal algorithms for \(k\)-item broadcast

Cites work

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

Cited in

(17)

• ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
• scientific article; zbMATH DE number 1948475 (Why is no real title available?)
• Perfect broadcasting in unlabeled networks
• Broadcasting in wraparound meshes with parallel monodirectional links
• scientific article; zbMATH DE number 2089187 (Why is no real title available?)
• Bandwidth efficient all-to-all broadcast on switched clusters
• Optimal broadcast on parallel locality models
• Optimal consistent network updates in polynomial time
• scientific article; zbMATH DE number 1760004 (Why is no real title available?)
• Multiphase complete exchange: a theoretical analysis
• Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
• Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
• A \(\sqrt {N \over G}\) method for generating communication
• scientific article; zbMATH DE number 714582 (Why is no real title available?)
• Distributed Broadcast Revisited: Towards Universal Optimality
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Time-step optimal broadcasting in 3-D meshes with minimum total communication distance

Describes a project that uses

Uses Software

• MPI

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

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