UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
A bridging model for parallel computation
Communications of the ACM
Low overhead parallel schedules for task graphs
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The bulk-synchronous parallel random access machine
Theoretical Computer Science - Special issue on parallel computing
BSPlib: The BSP programming library
Parallel Computing
Preemptive Scheduling of Uniform Processor Systems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A BSP Approach to the Scheduling of Tightly-Nested Loops
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Exchange of Messages of Different Sizes
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Optimal k-linear Scheduling of Tree-Like Graphs for LogP-Machines
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Bulk Synchronous Parallel Scheduling of Uniform Dags
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Near Optimal Algorithms for Scheduling Independent Chains in BSP
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Portable and architecture independent parallel performance tuning using BSP
Parallel Computing
| Hi-index | 5.23 |
The aim of this work is to study a specific scheduling problem under the machine-independent model BSP. The problem of scheduling a set of independent chains in this context is shown to be a difficult optimization problem, but it can be easily approximated in practice. Efficient heuristics taking into account communications are proposed and analyzed in this paper. We particularly focus on the influence of synchronization between consecutive supersteps. A family of algorithms is proposed with the best possible load-balancing. Then, a strategy for determining a good compromise between the two opposite criteria of minimizing the number of supersteps and a good balance of the load is derived. Finally, a heuristic which considers the influence of the latency is presented. Simulations of a large number of instances have been carried out to complement the theoretical worst case analysis. They confirm the very good behavior of the algorithms on the average cases.