libKOMP, an Efficient OpenMP Runtime System for Both Fork-Join and Data Flow Paradigms
Authors:
- François BroquedisFBFrançois Broquedis
- Vincent DanjeanVDVincent Danjean
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 102-115
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Parallelizing dense and banded linear algebra libraries using SMPSsConcurrency and Computation: Practice and Experience, 2009
- A Proposal to Extend the OpenMP Tasking Model for Heterogeneous Architectures2009
- A class of parallel tiled linear algebra algorithms for multicore architecturesParallel Computing, 2009
- Evaluation of OpenMP Task Scheduling StrategiesLecture Notes in Computer Science, 2008
- Extending the OpenMP Tasking Model to Allow Dependent TasksLecture Notes in Computer Science, 2008
- Parallel Programmability and the Chapel LanguageThe International Journal of High Performance Computing Applications, 2007
- X10ACM SIGPLAN Notices, 2005
- Thread Scheduling for Multiprogrammed MultiprocessorsTheory of Computing Systems, 2001
- Two-dimensional block partitionings for the parallel sparse Cholesky factorizationNumerical Algorithms, 1997
- Cilk: An Efficient Multithreaded Runtime SystemJournal of Parallel and Distributed Computing, 1996