source:
CIVL/mods/dev.civl.abc/examples/omp/parallelfor.c
| Last change on this file was aad342c, checked in by , 3 years ago | |
|---|---|
|
|
| File size: 875 bytes | |
| Rev | Line | |
|---|---|---|
| [f2097b0] | 1 | #include <omp.h> |
| 2 | ||
| 3 | #define N 10 | |
| 4 | ||
| 5 | int main (int argc, char *argv[]) { | |
| 6 | double a[N], b[N]; | |
| 7 | int i, sum; | |
| [aad342c] | 8 | |
| [4900d83] | 9 | |
| [aad342c] | 10 | |
| [65657d6] | 11 | // This omp construct is completely eliminated |
| [aad342c] | 12 | /* |
| [a308739] | 13 | #pragma omp parallel for |
| 14 | for (i=0; i < N-1; i++) | |
| 15 | b[i+1] = a[i+1] + 2*i; | |
| [aad342c] | 16 | */ |
| 17 | ||
| [a308739] | 18 | // These nested omp constructs are completely eliminated |
| 19 | #pragma omp parallel | |
| 20 | { | |
| 21 | #pragma omp for | |
| 22 | for (i=0; i < N-1; i++) | |
| 23 | b[i+1] = a[i+1] + 2*i; | |
| 24 | } | |
| 25 | ||
| [aad342c] | 26 | /* |
| [f2097b0] | 27 | #pragma omp parallel for |
| 28 | for (i=0; i < N; i++) { | |
| 29 | a[i] = 0.0; | |
| 30 | b[i] = a[i]; | |
| 31 | b[i] = a[i] + b[i]; | |
| 32 | } | |
| 33 | ||
| 34 | #pragma omp parallel for | |
| [aad342c] | 35 | for (i=0; i < N-1; i++) |
| 36 | a[i+1] = a[1+i] + 1; | |
| 37 | //a[i+2-1] = a[(-2*3) + 2*i - i + 7] + 1; | |
| 38 | ||
| [9ee762a] | 39 | |
| [f2097b0] | 40 | #pragma omp parallel for private(sum) |
| 41 | for (i=0; i < N; i++) | |
| 42 | sum = sum + i; | |
| 43 | ||
| 44 | #pragma omp parallel for | |
| 45 | for (i=0; i < N; i++) | |
| 46 | sum = sum + i; | |
| [aad342c] | 47 | */ |
| [f2097b0] | 48 | |
| 49 | } |
Note:
See TracBrowser
for help on using the repository browser.
