1-optimality of static BSP computations: Scheduling independent chains as a case study.
From MaRDI portal
Publication:1401163
DOI10.1016/S0304-3975(02)00039-7zbMath1044.68022MaRDI QIDQ1401163
Alfredo Goldman, Grégory Mounié, Denis Trystram
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Uses Software
Cites Work
- Unnamed Item
- UET scheduling with unit interprocessor communication delays
- The bulk-synchronous parallel random access machine
- Optimal broadcast on parallel locality models
- Scheduling chains on uniform processors with communication delays
- Computer science today. Recent trends and developments
- Preemptive Scheduling of Uniform Processor Systems
- An Application of Bin-Packing to Multiprocessor Scheduling
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
- Some Results On Scheduling Flat Trees In LogP Model
This page was built for publication: 1-optimality of static BSP computations: Scheduling independent chains as a case study.