| Full text | |
| Author(s): |
Salamanca, Juan
;
Baldassin, Alexandro
;
Fan, X
;
DeSupinski, BR
;
Sinnen, O
;
Giacaman, N
Total Authors: 6
|
| Document type: | Journal article |
| Source: | OPENMP: CONQUERING THE FULL HARDWARE SPECTRUM, IWOMP 2019; v. 11718, p. 16-pg., 2019-01-01. |
| Abstract | |
Parallelization constructs in OpenMP, such as parallel for or taskloop, are typically restricted to loops that have no loop-carried dependencies (DOALL) or that contain well-known structured dependence patterns (e.g. reduction). These restrictions prevent the parallelization of many computational intensive may DOACROSS loops. In such loops, the compiler cannot prove that the loop is free of loop-carried dependencies, although they may not exist at runtime. This paper proposes a new clause for taskloop that enables speculative parallelization of may DOACROSS loops: the tls clause. We also present an initial evaluation that reveals that: (a) for certain loops, slowdowns using DOACROSS techniques can be transformed in speed-ups of up to 2.14x by applying speculative parallelization of tasks; and (b) the scheduling of tasks implemented in the Intel OpenMP runtime exacerbates the ratio of order inversion aborts after applying the taskloop-tls parallelization to a loop. (AU) | |
| FAPESP's process: | 18/15519-5 - Performance optimizations for multicore architectures |
| Grantee: | Alexandro José Baldassin |
| Support Opportunities: | Research Grants - Young Investigators Grants - Phase 2 |
| FAPESP's process: | 18/07446-8 - Integrating Speculative Execution to Loop and Task-based Parallelization |
| Grantee: | Juan Jesús Salamanca Guillén |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |