A dependency-aware task-based programming environment for multi-core architectures
J. M. PÉREZ, Rosa M. Badia, Jesús Labarta · Proceedings · 2008
Parallel programming on SMP and multi-core architectures is hard. In this paper we present a programming model for those environments based on automatic function level parallelism that strives to be easy, flexible, portable, and performant. Its main trait is its ability to exploit task level parallelism by analyzing task dependencies at run time. We present the programming environment in the context of algorithms from several domains and pinpoint its benefits compared to other approaches. We discuss its execution model and its scheduler. Finally we analyze its performance and demonstrate that it offers reasonable performance without tuning, and that it can rival highly tuned libraries with minimal tuning effort.
Cited by 233 works. doi:10.1109/clustr.2008.4663765
Authors
References
- Numerical recipes in C: the art of scientific computing
- Numerical recipes in Pascal: the art of scientific computing
- Gaussian elimination is not optimal
- Basic Linear Algebra Subprograms for Fortran Usage
- Dependence graphs and compiler optimizations
- The Landscape of Parallel Computing Research: A View from Berkeley
- The implementation of the Cilk-5 multithreaded language
- A class of parallel tiled linear algebra algorithms for multicore architectures
- Numerical Recipes in Fortran: The Art of Scientific Computing.
- GEMM-based level 3 BLAS