Name
Abstract | ||
|---|---|---|
OpenMP allows programmers to specify nested parallelism in parallel applications. In the case of scientific applications, parallel loops are the most important source of parallelism. In this paper we present an automatic mechanism to dynamically detect the best way to exploit the parallelism when having nested parallel loops. This mechanism is based on the number of threads, the problem size, and the number of iterations on the loop. To do that, we claim that programmers must specify the potential application parallelism and give the runtime the responsibility to decide the best way to exploit it. We have implemented this mechanism inside the IBM XL runtime library. Evaluation shows that our mechanism dynamically adapts the parallelism generated to the application and runtime parameters, reaching the same speedup as the best static parallelization (with a priori information). |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-31832-3_12 | WOMPAT |
Keywords | Field | DocType |
parallel loop,mechanism dynamically,nested parallelism,nested parallel loop,parallel application,runtime adjustment,automatic mechanism,scientific application,runtime parameter,parallel nested loop,potential application parallelism,ibm xl runtime library,nested loops | Instruction-level parallelism,Implicit parallelism,Task parallelism,Computer science,Parallel computing,Runtime library,Data parallelism,Scalable parallelism,Speedup,Nested loop join | Conference |
Volume | ISSN | ISBN |
3349 | 0302-9743 | 3-540-24560-X |
Citations | PageRank | References |
10 | 0.87 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alejandro Duran | 1 | 943 | 61.43 |
| Raul Silvera | 2 | 179 | 10.74 |
| Julita Corbalán | 3 | 339 | 23.32 |
| Jesús Labarta | 4 | 1862 | 165.09 |