mirror of
https://github.com/OpenMP/Examples.git
synced 2025-04-07 23:22:11 +01:00
29 lines
811 B
C
29 lines
811 B
C
/*
|
|
* @@name: task_dep.5c
|
|
* @@type: C
|
|
* @@compilable: yes
|
|
* @@linkable: no
|
|
* @@expect: success
|
|
*/
|
|
// Assume BS divides N perfectly
|
|
void matmul_depend(int N, int BS, float A[N][N], float B[N][N], float
|
|
C[N][N] )
|
|
{
|
|
int i, j, k, ii, jj, kk;
|
|
for (i = 0; i < N; i+=BS) {
|
|
for (j = 0; j < N; j+=BS) {
|
|
for (k = 0; k < N; k+=BS) {
|
|
// Note 1: i, j, k, A, B, C are firstprivate by default
|
|
// Note 2: A, B and C are just pointers
|
|
#pragma omp task private(ii, jj, kk) \
|
|
depend ( in: A[i:BS][k:BS], B[k:BS][j:BS] ) \
|
|
depend ( inout: C[i:BS][j:BS] )
|
|
for (ii = i; ii < i+BS; ii++ )
|
|
for (jj = j; jj < j+BS; jj++ )
|
|
for (kk = k; kk < k+BS; kk++ )
|
|
C[ii][jj] = C[ii][jj] + A[ii][kk] * B[kk][jj];
|
|
}
|
|
}
|
|
}
|
|
}
|