Optimal broadcast for fully connected processor-node networks
DOI10.1016/J.JPDC.2007.12.001zbMATH Open1243.68033OpenAlexW2062810083MaRDI QIDQ436809FDOQ436809
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
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
broadcastmessage passing interface (MPI)bidirectional communication modelfully connected communication networkSMP cluster
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)
Cites Work
- A survey of gossiping and broadcasting in communication networks
- Optimum broadcasting and personalized communication in hypercubes
- Methods and problems of communication in usual networks
- Optimal multiple message broadcasting in telephone-like communication systems
- 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
- Designing broadcasting algorithms in the postal model for message-passing systems
- Multiple message broadcasting in communication networks
Cited In (15)
- ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
- Title not available (Why is that?)
- Perfect broadcasting in unlabeled networks
- Broadcasting in wraparound meshes with parallel monodirectional links
- Title not available (Why is that?)
- Optimal broadcast on parallel locality models
- Title not available (Why is that?)
- Multiphase complete exchange: a theoretical analysis
- Optimal consistent network updates in polynomial time
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
- Title not available (Why is that?)
- 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
Uses Software
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)
