Projects per year
We evaluate BDDT using a representative set of benchmarks, and we compare it to SMPSs (the equivalent runtime system in StarSs) and OpenMP. BDDT performs comparable to or better than SMPSs and is able to cope with task granularity as much as one order of magnitude finer than SMPSs. Compared to OpenMP, BDDT performs up to 3.9× better for benchmarks that benefit from dynamic dependence analysis. BDDT provides additional data annotations to bypass dependence analysis. Using these annotations, BDDT outperforms OpenMP also in benchmarks where dependence analysis does not discover additional parallelism, thanks to a more efficient implementation of the runtime system.
|Title of host publication||Advanced Parallel Processing Technologies|
|Subtitle of host publication||10th International Symposium, APPT 2013, Stockholm, Sweden, August 27-28, 2013, Revised Selected Papers|
|Editors||Chenggang Wu, Albert Cohen|
|Number of pages||15|
|Publication status||Published - Sep 2013|
|Name||Lecture Notes in Computer Science|
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
FingerprintDive into the research topics of 'BDDT: Block-level Dynamic Dependence Analysis for Task-Based Parallelism'. Together they form a unique fingerprint.
- 1 Invited talk
Invited Talk and membership in panel at the "European Initiative on Runtime Systems and Architecture Co-Design"
Hans Vandierendonck (Speaker)07 May 2015
Activity: Talk or presentation types › Invited talk