A dependency-aware task-based programming environment for multi-core architectures
- 1 September 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15525244,p. 142-151
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- High-performance implementation of the level-3 BLASACM Transactions on Mathematical Software, 2008
- An experimental comparison of cache-oblivious and cache-conscious programs2007
- Satisfying your dependencies with SuperMatrix2007
- CellSs: a Programming Model for the Cell BE Architecture2006
- Programming Grid Applications with GRID SuperscalarJournal of Grid Computing, 2003
- Exploiting pipelined executions in OpenMP2003
- Flexible control structures for parallelism in OpenMPConcurrency: Practice and Experience, 2000
- Optimal Parallel Merging and Sorting Without Memory ConflictsIEEE Transactions on Computers, 1987
- Basic Linear Algebra Subprograms for Fortran UsageACM Transactions on Mathematical Software, 1979
- Gaussian elimination is not optimalNumerische Mathematik, 1969