Optimal broadcast on parallel locality models

DOI10.1016/S1570-8667(03)00023-6MaRDI QIDQ1827284zbMATH OpenFDO

Authors Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping, Ben H. H. Juurlink

Publication date 6 August 2004

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

BSP modelParallel computingLower boundsBroadcastH-PRAM

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Communication in parallel systems : Models, algorithms and implementations
• Optimal broadcast for fully connected processor-node networks
• Multiple message broadcasting in the postal model
• Optimal and near-optimal algorithms for \(k\)-item broadcast
• A lower bound for radio broadcast

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1760004 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A practical hierarchical model of parallel computation. I: The model
• A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms
• Modeling parallel bandwidth: Local versus global restrictions
• Real-time emulations of bounded-degree networks

Cited in

(6)

• ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
• 1-optimality of static BSP computations: Scheduling independent chains as a case study.
• Designing broadcasting algorithms in the postal model for message-passing systems
• Optimal serial broadcast of successive chunks
• Optimal broadcasting for locally twisted cubes
• Distributed Broadcast Revisited: Towards Universal Optimality

This page was built for publication: Optimal broadcast on parallel locality models

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