Name
Abstract | ||
|---|---|---|
OpenMP tasks were introduced in order to support irregular parallelism. However, task runtime overhead is necessarily higher than for worksharing constructs, and can hamper performance if the tasks are too finely grained. In this paper, we address the common use case, of tasks generated in a tree-like hierarchy, with task granularity decreasing with increasing depth, and propose a new final clause to force coalescing of excessively fine grained tasks. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13217-9_5 | IWOMP |
Keywords | Field | DocType |
tree-like hierarchy,new final clause,irregular parallelism,task runtime overhead,openmp task,common use case,worksharing construct,task granularity,fine grained task,openmp tasking control,use case | Computer science,Parallel computing,Final clause,Granularity,Hierarchy,Distributed computing | Conference |
Volume | ISSN | ISBN |
6132 | 0302-9743 | 3-642-13216-2 |
Citations | PageRank | References |
2 | 0.40 | 8 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eduard Ayguadé | 1 | 2406 | 216.00 |
| James C. Beyer | 2 | 39 | 4.99 |
| Alejandro Duran | 3 | 943 | 61.43 |
| Roger Ferrer | 4 | 121 | 10.31 |
| Grant Haab | 5 | 39 | 3.90 |
| Kelvin Li | 6 | 169 | 19.01 |
| Federico Massaioli | 7 | 224 | 18.05 |