Optimal and near-optimal algorithms for k-item broadcast

DOI10.1006/JPDC.1999.1529MaRDI QIDQ1291007zbMATH OpenOpenAlexFDO

Authors Eunice E. Santos

Publication date 25 January 2000

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

Full work available at URL https://doi.org/10.1006/jpdc.1999.1529

zbMATH Keywords

distributed-memory machines

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Optimal multiple message broadcasting in telephone-like communication systems
• Optimal broadcast for fully connected processor-node networks
• scientific article; zbMATH DE number 714582
• An optimal algorithm for broadcasting multiple messages in trees
• Optimal point-to-point broadcast algorithms via lopsided trees

Cited in

(10)

• A bandwidth latency tradeoff for broadcast and reduction
• Research on the optimal parallel algorithms of broadcast-class problems
• Optimal point-to-point broadcast algorithms via lopsided trees
• Optimal broadcast on parallel locality models
• On designing optimal parallel triangular solvers.
• ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
• Optimal Broadcast with Partial Knowledge
• scientific article; zbMATH DE number 714582 (Why is no real title available?)
• Optimal broadcast for fully connected processor-node networks
• Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models

This page was built for publication: Optimal and near-optimal algorithms for \(k\)-item broadcast

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