Optimal and near-optimal algorithms for \(k\)-item broadcast
From MaRDI portal
Publication:1291007
DOI10.1006/JPDC.1999.1529zbMath0929.68124OpenAlexW2067311578MaRDI QIDQ1291007
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
Related Items (4)
Optimal broadcast for fully connected processor-node networks ⋮ Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models ⋮ A bandwidth latency tradeoff for broadcast and reduction ⋮ On designing optimal parallel triangular solvers.
This page was built for publication: Optimal and near-optimal algorithms for \(k\)-item broadcast
