Optimal and near-optimal algorithms for k-item broadcast
From MaRDI portal
Publication:1291007
DOI10.1006/JPDC.1999.1529zbMATH Open0929.68124OpenAlexW2067311578MaRDI QIDQ1291007FDOQ1291007
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
Cited In (6)
- ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
- Optimal broadcast for fully connected processor-node networks
- A bandwidth latency tradeoff for broadcast and reduction
- On designing optimal parallel triangular solvers.
- Title not available (Why is that?)
- Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
Recommendations
- Optimal multiple message broadcasting in telephone-like communication systems 👍 👎
- Optimal broadcast for fully connected processor-node networks 👍 👎
- Title not available (Why is that?) 👍 👎
- An optimal algorithm for broadcasting multiple messages in trees 👍 👎
- Optimal point-to-point broadcast algorithms via lopsided trees 👍 👎
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)
