filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/cfd/euler3d_cpu_double.cpp | #pragma omp parallel for default(shared) schedule(static) | 100 | d dealloc(T* array)
{
delete[] array;
}
template <typename T>
void copy(T* dst, T* src, int N)
{
<LOOP-START>for(int i = 0; i < N; i++)
{
dst[i] = src[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) schedule(static)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/cfd/euler3d_cpu_double.cpp | #pragma omp parallel for default(shared) schedule(static) | 100 | e3 ff_flux_contribution_density_energy;
void initialize_variables(int nelr, double* variables)
{
<LOOP-START>for(int i = 0; i < nelr; i++)
{
for(int j = 0; j < NVAR; j++) variables[i*NVAR + j] = ff_variable[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) schedule(static)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/cfd/euler3d_cpu_double.cpp | #pragma omp parallel for default(shared) schedule(static) | 100 |
}
void compute_step_factor(int nelr, double* variables, double* areas, double* step_factors)
{
<LOOP-START>for(int i = 0; i < nelr; i++)
{
double density = variables[NVAR*i + VAR_DENSITY];
double3 momentum;
momentum.x = variables[NVAR*i + (VAR_MOMENTUM+0)];
momentum.y = variables[NVAR*i + (VAR_MOMENTUM+1... |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/cfd/euler3d_cpu_double.cpp | #pragma omp parallel for default(shared) schedule(static) | 100 | normals, double* variables, double* fluxes)
{
const double smoothing_coefficient = double(0.2f);
<LOOP-START>for(int i = 0; i < nelr; i++)
{
int j, nb;
double3 normal; double normal_len;
double factor;
double density_i = variables[NVAR*i + VAR_DENSITY];
double3 momentum_i;
momentum_i.x = variables[NVAR... |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/cfd/euler3d_cpu_double.cpp | #pragma omp parallel for default(shared) schedule(static) | 100 | int j, int nelr, double* old_variables, double* variables, double* step_factors, double* fluxes)
{
<LOOP-START>for(int i = 0; i < nelr; i++)
{
double factor = step_factors[i]/double(RK+1-j);
variables[NVAR*i + VAR_DENSITY] = old_variables[NVAR*i + VAR_DENSITY] + factor*fluxes[NVAR*i + VAR_DENSITY];
variables[N... |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/hotspot/hotspot_openmp.cpp | #pragma omp parallel for shared(power, temp, result) private(chunk, r, c, delta) firstprivate(row, col, num_chunk, chunks_in_row) schedule(static) | 100 | LOCK_SIZE_R;
#ifdef OPEN
#ifndef __MIC__
omp_set_num_threads(num_omp_threads);
#endif
<LOOP-START>for ( chunk = 0; chunk < num_chunk; ++chunk )
{
int r_start = BLOCK_SIZE_R*(chunk/chunks_in_col);
int c_start = BLOCK_SIZE_C*(chunk%chunks_in_row);
int r_end = r_start + BLOCK_SIZ... |
LLNL/AutoParBench/benchmarks/original/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | ====================================================
omp_set_num_threads(omp_num_threads);
<LOOP-START>for(i=0; i<public.allPoints; i++){
kernel( public,
private[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(j) reduction(+:norm_temp11,norm_temp12) | 100 | ---------------------------------------------------------*/
norm_temp11 = 0.0;
norm_temp12 = 0.0;
<LOOP-START>for (j = 1; j <= lastcol-firstcol+1; j++) {
norm_temp11 = norm_temp11 + x[j]*z[j];
norm_temp12 = norm_temp12 + z[j]*z[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(share... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(j) | 100 | -
c Normalize z to obtain x
c-------------------------------------------------------------------*/
<LOOP-START>for (j = 1; j <= lastcol-firstcol+1; j++) {
x[j] = norm_temp12*z[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(i) | 100 | ing vector to (1, 1, .... 1)
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 1; i <= NA+1; i++) {
x[i] = 1.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(j) reduction(+:norm_temp11,norm_temp12) | 100 | --------------------------------------------------------*/
norm_temp11 = 0.0;
norm_temp12 = 0.0;
<LOOP-START>for (j = 1; j <= lastcol-firstcol+1; j++) {
norm_temp11 = norm_temp11 + x[j]*z[j];
norm_temp12 = norm_temp12 + z[j]*z[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(share... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(j) | 100 | -
c Normalize z to obtain x
c-------------------------------------------------------------------*/
<LOOP-START>for (j = 1; j <= lastcol-firstcol+1; j++) {
x[j] = norm_temp12*z[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(i) | 100 | to mark nonzero positions
c---------------------------------------------------------------------*/
<LOOP-START>for (i = 1; i <= n; i++) {
colidx[n+i] = 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(j) | 100 | umber of triples in each row
c-------------------------------------------------------------------*/
<LOOP-START>for (j = 1; j <= n; j++) {
rowstr[j] = 0;
mark[j] = FALSE;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(k,j) | 100 | ... preload data pages
c---------------------------------------------------------------------*/
<LOOP-START>for(j = 0;j <= nrows-1;j++) {
for(k = rowstr[j];k <= rowstr[j+1]-1;k++)
a[k] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(k,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/CG/cg.c | #pragma omp parallel for default(shared) private(i) | 100 | adding elements
c-------------------------------------------------------------------*/
nza = 0;
<LOOP-START>for (i = 1; i <= n; i++) {
x[i] = 0.0;
mark[i] = FALSE;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(i) <OMP-END> |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/FT/ft.c | #pragma omp parallel for default(shared) private(i,j,k) | 100 | ier space
c-------------------------------------------------------------------*/
int i, j, k;
<LOOP-START>for (k = 0; k < d[2]; k++) {
for (j = 0; j < d[1]; j++) {
for (i = 0; i < d[0]; i++) {
crmul(u1[k][j][i], u0[k][j][i], ex[t*indexmap[k][j][i]]);
}
}
}<LOOP-END> <OMP-START>#pragm... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/FT/ft.c | #pragma omp parallel for default(shared) private(i,j,k,ii,ii2,jj,ij2,kk) | 100 | ck:
c mod(i-1+n/2, n) - n/2
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 0; i < dims[2][0]; i++) {
ii = (i+1+xstart[2]-2+NX/2)%NX - NX/2;
ii2 = ii*ii;
for (j = 0; j < dims[2][1]; j++) {
jj = (j+1+ystart[2]-2+NY/2)%NY - NY/2;
ij2 = jj*jj+ii2;
... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/SP/sp.c | #pragma omp parallel for default(shared) private(i,j,k,r1,r2,r3,r4,r5,t1,t2) | 100 | --------------------------------------------*/
int i, j, k;
double r1, r2, r3, r4, r5, t1, t2;
<LOOP-START>for (i = 1; i <= grid_points[0]-2; i++) {
for (j = 1; j <= grid_points[1]-2; j++) {
for (k = 1; k <= grid_points[2]-2; k++) {
r1 = rhs[0][i][j][k];
r2 = rhs[1][i][j][k];
r3 = rhs[2][i][j][k];
r... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/SP/sp.c | #pragma omp parallel for default(shared) private(i,j,k,r1,r2,r3,r4,r5,t1,t2) | 100 | -------------------------------------------*/
int i, j, k;
double r1, r2, r3, r4, r5, t1, t2;
<LOOP-START>for (i = 1; i <= grid_points[0]-2; i++) {
for (j = 1; j <= grid_points[1]-2; j++) {
for (k = 1; k <= grid_points[2]-2; k++) {
r1 = rhs[0][i][j][k];
r2 = rhs[1][i][j][k];
r3 = rhs[2][i][j][k];
r... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/EP/ep.c | #pragma omp parallel for default(shared) private(i) | 100 | code.
*/
vranlc(0, &(dum[0]), dum[1], &(dum[2]));
dum[0] = randlc(&(dum[1]), dum[2]);
<LOOP-START>for (i = 0; i < 2*NK; i++) x[i] = -1.0e99;
Mops = log(sqrt(fabs(max(1.0, 1.0))));
timer_clear(1);
timer_clear(2);
timer_clear(3);
timer_start(1);
vranlc(0, &t1, A, x);
/* Com... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for default(shared) private(i1,i2,i3,r1,r2) | 100 | ---------------------------------------------------*/
int i3, i2, i1;
double r1[M], r2[M];
<LOOP-START>for (i3 = 1; i3 < n3-1; i3++) {
for (i2 = 1; i2 < n2-1; i2++) {
for (i1 = 0; i1 < n1; i1++) {
r1[i1] = r[i3][i2-1][i1] + r[i3][i2+1][i1]
+ r[i3-1][i2][i1] + r[i3+1][i2][i1];
r2[i1] = r[... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for default(shared) private(i1,i2,i3,u1,u2) | 100 | ---------------------------------------------------*/
int i3, i2, i1;
double u1[M], u2[M];
<LOOP-START>for (i3 = 1; i3 < n3-1; i3++) {
for (i2 = 1; i2 < n2-1; i2++) {
for (i1 = 0; i1 < n1; i1++) {
u1[i1] = u[i3][i2-1][i1] + u[i3][i2+1][i1]
+ u[i3-1][i2][i1] + u[i3+1][i2][i1];
u2[i1] =... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for default(shared) private(j1,j2,j3,i1,i2,i3,x1,y1,x2,y2) | 100 | lse {
d2 = 1;
}
if (m3k == 3) {
d3 = 2;
} else {
d3 = 1;
}
<LOOP-START>for (j3 = 1; j3 < m3j-1; j3++) {
i3 = 2*j3-d3;
/*C i3 = 2*j3-1*/
for (j2 = 1; j2 < m2j-1; j2++) {
i2 = 2*j2-d2;
/*C i2 = 2*j2-1*/
for (j1 = 1; j1 < m1j; j1++) {
i... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for default(shared) private(i1,i2,i3,z1,z2,z3) | 100 | parameter( m=535 )
*/
double z1[M], z2[M], z3[M];
if ( n1 != 3 && n2 != 3 && n3 != 3 ) {
<LOOP-START>for (i3 = 0; i3 < mm3-1; i3++) {
for (i2 = 0; i2 < mm2-1; i2++) {
for (i1 = 0; i1 < mm1; i1++) {
z1[i1] = z[i3][i2+1][i1] + z[i3][i2][i1];
z2[i1] = z[i3+1][i2][i1] + z[i3][i2][i1];
... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for default(shared) private(i1,i2,i3,a) reduction(+:s) reduction(max:tmp) | 100 | --*/
double s = 0.0;
int i3, i2, i1, n;
double a = 0.0, tmp = 0.0;
n = nx*ny*nz;
<LOOP-START>for (i3 = 1; i3 < n3-1; i3++) {
for (i2 = 1; i2 < n2-1; i2++) {
for (i1 = 1; i1 < n1-1; i1++) {
s = s + r[i3][i2][i1] * r[i3][i2][i1];
a = fabs(r[i3][i2][i1]);
if (a > tmp) tmp = a;
}
... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for private(i2, i1) | 100 | ber\n");
for (i = MM-1; i >= 0; i--) {
printf(" %4d", jg[0][i][1]);
}
printf("\n");*/
<LOOP-START>for (i3 = 0; i3 < n3; i3++) {
for (i2 = 0; i2 < n2; i2++) {
for (i1 = 0; i1 < n1; i1++) {
z[i3][i2][i1] = 0.0;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i2, i1) <... |
LLNL/AutoParBench/benchmarks/original/NPB3.0-omp-c/MG/mg.c | #pragma omp parallel for private(i1,i2,i3) | 100 | -------
c-------------------------------------------------------------------*/
int i1, i2, i3;
<LOOP-START>for (i3 = 0;i3 < n3; i3++) {
for (i2 = 0; i2 < n2; i2++) {
for (i1 = 0; i1 < n1; i1++) {
z[i3][i2][i1] = 0.0;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i1,i2,i3)<OMP... |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB049-fprintf-orig-no.c | #pragma omp parallel for simd | 100 | ain(int argc, char* argv[])
{
int i;
int ret;
FILE* pfile;
int len=1000;
int A[1000];
<LOOP-START>for (i=0; i<len; i++)
A[i]=i;
pfile = fopen("mytempfile.txt","a+");
if (pfile ==NULL)
{
fprintf(stderr,"Error in fopen()\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB049-fprintf-orig-no.c | #pragma omp parallel for simd ordered | 100 | en("mytempfile.txt","a+");
if (pfile ==NULL)
{
fprintf(stderr,"Error in fopen()\n");
}
<LOOP-START>for (i=0; i<len; ++i)
{
#pragma omp ordered simd
fprintf(pfile, "%d\n", A[i] );
}<LOOP-END> <OMP-START>#pragma omp parallel for simd ordered<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for simd | 100 | rgv[])
{
int i;
int tmp;
int len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i=0;i<len;i++)
a[i]=i;
#pragma omp parallel for simd private(tmp)
for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for simd private(tmp) | 100 | atoi(argv[1]);
int a[len];
#pragma omp parallel for simd
for (i=0;i<len;i++)
a[i]=i;
<LOOP-START>for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd private(tmp)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB050-functionparameter-orig-yes.c | #pragma omp parallel for simd | 100 | i] = volnew_o8;
}
}
int main()
{
double o1[101];
double c[101];
int i;
int len = 100;
<LOOP-START>for (i = 0; i < len; ++i) {
c[i] = i + 1.01;
o1[i] = i + 1.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for simd | 100 | Arrays passed as function parameters
*/
void foo1(double o1[], double c[], int len)
{
int i ;
<LOOP-START>for (i = 0; i < len; ++i) {
double volnew_o8 = 0.5 * c[i];
o1[i] = volnew_o8;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for simd | 100 | o1[i] = volnew_o8;
}
}
double o1[100];
double c[100];
int main()
{
int i;
int len = 100;
<LOOP-START>for (i = 0; i < len; ++i) {
c[i] = i + 1.01;
o1[i] = i + 1.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for simd | 100 | ude <stdio.h>
int main(int argc, char* argv[])
{
int i;
int tmp;
int len=100;
int a[100];
<LOOP-START>for (i=0;i<len;i++)
a[i]=i;
#pragma omp parallel for simd private(tmp)
for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for simd private(tmp) | 100 | ;
int len=100;
int a[100];
#pragma omp parallel for simd
for (i=0;i<len;i++)
a[i]=i;
<LOOP-START>for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd private(tmp)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for simd firstprivate (g) | 100 | nclude <stdlib.h>
/*
Example use of firstprivate()
*/
void foo(int * a, int n, int g)
{
int i;
<LOOP-START>for (i=0;i<n;i++)
{
a[i] = a[i]+g;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd firstprivate (g)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for simd | 100 | for (i=0;i<n;i++)
{
a[i] = a[i]+g;
}
}
int a[100];
int main()
{
int i;
int n = 100;
<LOOP-START>for (i=0;i<n;i++)
{
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for simd ordered | 100 | 00;
#pragma omp parallel for simd
for (i=0;i<n;i++)
{
a[i] = i;
}
foo(a, 100, 7);
<LOOP-START>for (i=0;i<n;i++)
{
#pragma omp ordered simd
printf("%d\n",a[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd ordered<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(j) | 100 | e <stdlib.h>
int main(int argc,char *argv[])
{
int i, j;
int len = 20;
double a[20][20];
<LOOP-START>for (i=0; i< len; i++)
#pragma omp parallel for simd
for (j=0; j<len; j++)
a[i][j] = (i * len + j + 0.5);
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for simd
for (j = ... |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for simd | 100 | len = 20;
double a[20][20];
#pragma omp parallel for private(j)
for (i=0; i< len; i++)
<LOOP-START>for (j=0; j<len; j++)
a[i][j] = (i * len + j + 0.5);
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for simd
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}... |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for simd | 100 | r (j=0; j<len; j++)
a[i][j] = (i * len + j + 0.5);
for (i = 0; i < len - 1; i += 1) {
<LOOP-START>for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for simd <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for simd | 100 | * xa1 = base;
double * xa2 = xa1 + 2014;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i =521; i<= 2025; ++i)
{
base[i]=0.5*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for simd schedule(static,1) | 100 | ]=0.5*i;
}
// default static even scheduling may not trigger data race, using static,1 instead.
<LOOP-START>for (i =0; i< N; ++i)
{
int idx = indexSet[i];
xa1[idx]+= 1.0 + i;
xa2[idx]+= 3.0 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule(static,1)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(j) | 100 | ])
{
int i, j;
int len = 20;
if (argc>1)
len = atoi(argv[1]);
double a[len][len];
<LOOP-START>for (i=0; i< len; i++)
#pragma omp parallel for simd
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for simd
for (j = 0; j < len ; j += ... |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for simd | 100 | rgv[1]);
double a[len][len];
#pragma omp parallel for private(j)
for (i=0; i< len; i++)
<LOOP-START>for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for simd
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-S... |
LLNL/AutoParBench/benchmarks/reference_cpu_simd/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for simd | 100 | for simd
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
<LOOP-START>for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
RRZE-HPC/MD-Bench/src/clusterpair/force_eam.c | #pragma omp parallel for | 100 | eam->nrho_tot;
*/
double S = getTimeStamp();
LIKWID_MARKER_START("force");
/*
<LOOP-START>for(int i = 0; i < Nlocal; i++) {
neighs = &neighbor->neighbors[i * neighbor->maxneighs];
int numneighs = neighbor->numneigh[i];
MD_FLOAT xtmp = atom_x(i);
MD_FLOAT ytmp = atom... |
imsure/parallel-programming/matrix-multiplication/matrix-mul-openmp.c | #pragma omp parallel for shared(matrix1, matrix2, matrix3, chunksize) \ | 100 | rintf( "Matrix 2:\n" );
print_matrix( matrix2, size );
}
gettimeofday( &tstart, NULL );
<LOOP-START>private(i,j,k,sum) schedule(static, chunksize)
for (i = 0; i < size; ++i) { // hold row index of 'matrix1'
for (j = 0; j < size; ++j) { // hold column index of 'matrix2'
sum = 0; // hold value of ... |
imsure/parallel-programming/red-black-grid-computation/rb-grid-hybrid.c | #pragma omp parallel for shared(grid,num_threads) private(i,j,jstart) schedule (static, chunk_size) | 100 | compute_grid_red( double **grid, int gridsize, int strip_size, int myrank )
{
int i, j, jstart;
<LOOP-START>for (i = 1; i < strip_size-1; i++) {
if (i % 2 == 1) jstart = 1; // odd row
else jstart = 2; // even row
for (j = jstart; j < gridsize-1; j += 2) {
grid[ i ][ j ] = ( grid[ i-1 ][ j ] +... |
imsure/parallel-programming/red-black-grid-computation/rb-grid-hybrid.c | #pragma omp parallel for shared(grid,num_threads) private(i,j,jstart) schedule (static, chunk_size) | 100 | ompute_grid_black( double **grid, int gridsize, int strip_size, int myrank )
{
int i, j, jstart;
<LOOP-START>for (i = 1; i < strip_size-1; i++) {
if (i % 2 == 1) jstart = 2; // odd row
else jstart = 1; // even row
for (j = jstart; j < gridsize-1; j += 2) {
grid[ i ][ j ] = ( grid[ i-1 ][ j ] +... |
n-roussos/Parallel-Programming-with-OpenMP/2. K-means with OpenMP/kmeans2/kmeans2.c | #pragma omp parallel for reduction(+:tot_dist) | 100 | n");
}
}
//returns the total minimum distance
float estimate_class(void) {
float tot_dist = 0.0;
<LOOP-START>for(int i=0;i<N;i++){
float min_dist = distance(Vec[i], Center[0]); //distance from first center = initial min
int class_num = 0; //corresponding classification is 0
float dist;
for(int j=1;j<NC... |
n-roussos/Parallel-Programming-with-OpenMP/2. K-means with OpenMP/kmeans3/kmeans3.c | #pragma omp parallel for reduction(+:tot_dist) schedule(static,50) | 100 | n");
}
}
//returns the total minimum distance
float estimate_class(void) {
float tot_dist = 0.0;
<LOOP-START>//#pragma omp simd
for(int i=0;i<N;i++){
float min_dist = distance(Vec[i], Center[0]); //distance from first center = initial min
int class_num = 0; //corresponding classification is 0
float dist... |
n-roussos/Parallel-Programming-with-OpenMP/2. K-means with OpenMP/kmeans4/kmeans4.c | #pragma omp parallel for reduction(+:tot_dist) schedule(static,50) | 100 | n");
}
}
//returns the total minimum distance
float estimate_class(void) {
float tot_dist = 0.0;
<LOOP-START>for(int i=0;i<N;i++){
float min_dist = distance(Vec[i], Center[0]); //distance from first center = initial min
int class_num = 0; //corresponding classification is 0
float dist;
for(int j=1;j<NC... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.0.c | #pragma omp parallel for reduction(my_min:nearest_city) private(dist) | 100 | ity.dist = 1e6;
nearest_city.city = -1;
printf("\n\nVISIT CLOSEST FROM: %d\n\n", to_visit-1);
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
printf("Distance between %d and %d: %f\n",i, Sequence[to_visi... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.3.c | #pragma omp parallel for reduction(my_min:nearest_city) private(dist) | 100 | initialize nearest_city
nearest nearest_city;
nearest_city.dist = 1e6;
nearest_city.city = -1;
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
if(dist < nearest_city.dist){
nearest_city.dist = dist;
... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.3.c | #pragma omp parallel for reduction(my_min:nearest_city1) private(dist) | 100 | _city1.dist = 1e6;
nearest_city1.city = -1;
nearest_city2.dist = 1e6;
nearest_city2.city = -1;
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
if(dist < nearest_city1.dist){
nearest_city1.dist = dist;... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.3.c | #pragma omp parallel for reduction(my_min:nearest_city2) private(dist) | 100 | ed[nearest_city1.city] = true;
return nearest_city1.dist;
}else{
//find second nearest city
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i] && i != nearest_city1.city){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
if(dist < nearest_city2.dist){
... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.2.c | #pragma omp parallel for reduction(my_min:nearest_city) private(dist) | 100 | initialize nearest_city
nearest nearest_city;
nearest_city.dist = 1e6;
nearest_city.city = -1;
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
if(dist < nearest_city.dist){
nearest_city.dist = dist;
... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.1.c | #pragma omp parallel for reduction(my_min:nearest_city) private(dist) | 100 | ity.dist = 1e6;
nearest_city.city = -1;
printf("\n\nVISIT CLOSEST FROM: %d\n\n", to_visit-1);
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
printf("Distance between %d and %d: %f\n",i, Sequence[to_visi... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.1.c | #pragma omp parallel for reduction(my_min:nearest_city1) private(dist) | 100 | t = 1e6;
nearest_city2.city = -1;
printf("\n\nVISIT SECOND CLOSEST FROM: %d\n\n", to_visit-1);
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i]){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
printf("Distance between %d and %d: %f\n",i, Sequence[to_visi... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman5/travelling_salesman5.1.c | #pragma omp parallel for reduction(my_min:nearest_city2) private(dist) | 100 | ed[nearest_city1.city] = true;
return nearest_city1.dist;
}else{
//find second nearest city
<LOOP-START>for(int i=1;i<NUM_CITIES;i++){
if(!Visited[i] && i != nearest_city1.city){
dist = distance(i, Sequence[to_visit-1]); //distance from last city on the sequence so far
if(dist < nearest_city2.dist){
... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.1.c | #pragma omp parallel for schedule(static,2) | 100 | ;
swapped_indices[1] = ind2;
}
void calc_adjacent_dists(int *swapped_indices, float *adj_dists){
<LOOP-START>for(int i=0;i<2;i++){
*adj_dists++ = distance(swapped_indices[i], swapped_indices[i]-1);
*adj_dists++ = distance(swapped_indices[i], swapped_indices[i]+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.1.c | #pragma omp parallel for simd reduction(+:old_tot_dist) schedule(static,4) | 100 | from the difference of only the 4 affected distances
//instead of recalculating every distance
<LOOP-START>for(int i=0;i<4;i++){
old_tot_dist += new_dists[i] - prev_dists[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for simd reduction(+:old_tot_dist) schedule(static,4)<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.1.c | #pragma omp parallel for reduction(+:tot_dist) | 100 | - prev_dists[i];
}
return old_tot_dist;
}
float total_distance(void){
float tot_dist = 0.0;
<LOOP-START>for (int i=0;i<NUM_CITIES;i++){
tot_dist += distance(i, i+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tot_dist)<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.0.c | #pragma omp parallel for schedule(static,2) | 100 | swapped_indices[1] = ind2;
}
void calc_adjacent_dists(int *swapped_indices, float *adj_dists){
//<LOOP-START>for(int i=0;i<2;i++){
*adj_dists++ = distance(swapped_indices[i], swapped_indices[i]-1);
*adj_dists++ = distance(swapped_indices[i], swapped_indices[i]+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for... |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.0.c | #pragma omp parallel for simd reduction(+:old_tot_dist) schedule(static,4) | 100 | rom the difference of only the 4 affected distances
//instead of recalculating every distance
//<LOOP-START>for(int i=0;i<4;i++){
old_tot_dist += new_dists[i] - prev_dists[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for simd reduction(+:old_tot_dist) schedule(static,4)<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/3. Travelling salesman problem/travelling_salesman2/travelling_salesman2.0.c | #pragma omp parallel for reduction(+:tot_dist) | 100 | - prev_dists[i];
}
return old_tot_dist;
}
float total_distance(void){
float tot_dist = 0.0;
<LOOP-START>for (int i=0;i<NUM_CITIES;i++){
tot_dist += distance(i, i+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tot_dist)<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens2/Queens2.0.c | #pragma omp parallel for | 100 | -; //backtrack to previous column
}
}
print_results(tries);
return 0;
}
void board_init(){
<LOOP-START>for(int i=0;i<N;i++){
ROWS_PLACED[i] = -1; //no queens are placed
VALID_ROWS[0][i] = true; //all rows of the first column are valid
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens2/Queens2.0.c | #pragma omp parallel for | 100 | irst column are valid
}
}
//calculates valid rows of next column
void calc_next_valid(int col){
<LOOP-START>for(int row=0;row<N;row++){
VALID_ROWS[col][row] = isvalid(row, col);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens2/Queens2.1.c | #pragma omp parallel for simd | 100 | en & backtrack to previous column
}
}
print_results(tries);
return 0;
}
void board_init(){
<LOOP-START>for(int i=0;i<N;i++){
ROWS_PLACED[i] = -1; //no queens are placed
for(int j=0;j<N;j++){
VALID_ROWS[i][j] = true; //all positions are valid
}
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-... |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens2/Queens2.1.c | #pragma omp parallel for | 100 | positions are valid
}
}
}
//calculates valid rows of current column
void calc_valid(int col){
<LOOP-START>for(int row=0;row<N;row++){
VALID_ROWS[col][row] = isvalid(row, col);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.1.c | #pragma omp parallel for private(gene1, gene2) | 100 | TION_SIZE-1] = 1.0;
while(1){
found = fitness();
if(found >= 0) break;
generation++;
<LOOP-START>for(int pair=0;pair<POPULATION_SIZE/2;pair++){
gene1 = select_gene();
gene2 = select_gene();
if(gene1 != gene2){
#pragma omp critical
crossover(NEW_POPULATION[gene1], NEW_POPULATION[gene2... |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.1.c | #pragma omp parallel for private(random_row) | 100 | ray is used --> max(N) = 256 = max(queens)
void population_init(void){
unsigned char random_row;
<LOOP-START>for(int i=0;i<POPULATION_SIZE;i++){ //each gene
for(int j=0;j<N;j++){ //each column
random_row = (unsigned char)rand()%N; //random row
POPULATION[i][j] = random_row;
NEW_POPULATION[i][j] = rand... |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.1.c | #pragma omp parallel for | 100 | pulation after crossover and mutation
void update_population(void){
//population = new population
<LOOP-START>for(int i=0;i<POPULATION_SIZE;i++){
#pragma omp simd
for(int j=0;j<N;j++){
POPULATION[i][j] = NEW_POPULATION[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.0.c | #pragma omp parallel for private(gene1, gene2) | 100 | TION_SIZE-1] = 1.0;
while(1){
found = fitness();
if(found >= 0) break;
generation++;
<LOOP-START>for(int pair=0;pair<POPULATION_SIZE/2;pair++){
gene1 = select_gene();
gene2 = select_gene();
if(gene1 != gene2){
#pragma omp critical
crossover(NEW_POPULATION[gene1], NEW_POPULATION[gene2... |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.0.c | #pragma omp parallel for private(random_row) | 100 | ray is used --> max(N) = 256 = max(queens)
void population_init(void){
unsigned char random_row;
<LOOP-START>for(int i=0;i<POPULATION_SIZE;i++){ //each gene
for(int j=0;j<N;j++){ //each column
random_row = (unsigned char)rand()%N; //random row
POPULATION[i][j] = random_row;
NEW_POPULATION[i][j] = rand... |
n-roussos/Parallel-Programming-with-OpenMP/5. N queens problem/Queens4/Queens4.0.c | #pragma omp parallel for | 100 | pulation after crossover and mutation
void update_population(void){
//population = new population
<LOOP-START>for(int i=0;i<POPULATION_SIZE;i++){
#pragma omp simd
for(int j=0;j<N;j++){
POPULATION[i][j] = NEW_POPULATION[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
n-roussos/Parallel-Programming-with-OpenMP/4. Neural networks/NN4/NN4.2.c | #pragma omp parallel for private(y) | 100 | n temp/((1+temp)*(1+temp));
}
void activate_NN(double *vector_in) {
double y;
//internal layer
<LOOP-START>for(int i=0;i<L1_NEURONS;i++){
//w0 corresponds to extra constant input 1
y = WL1[i][0]; //no point in multiplying by 1
#pragma omp simd
for(int j=1;j<L1_DIM;j++){
y += vector_in[j-1] * WL1[i][j];
... |
n-roussos/Parallel-Programming-with-OpenMP/4. Neural networks/NN4/NN4.2.c | #pragma omp parallel for private(acc) | 100 | d_derivative(DL2[i]) * (desired[i] - OL2[i]); //equation III
}
//internal neurons
double acc;
<LOOP-START>for(int i=0;i<L1_NEURONS;i++){
acc = 0.0;
#pragma omp simd
for(int k=0;k<L2_NEURONS;k++){
acc += DELTA_L2[k] * temp[i+1][k];
}
DELTA_L1[i] = sigmoid_derivative(DL1[i]) * acc; //equation II
}<LOO... |
n-roussos/Parallel-Programming-with-OpenMP/4. Neural networks/NN4/NN4.2.c | #pragma omp parallel for private(delta_i) | 100 | ; //equation II
}
}
void update_weights(double *vector_in){
double delta_i;
//layer 1 weights
<LOOP-START>for(int i=0;i<L1_NEURONS;i++){
delta_i = DELTA_L1[i];
WL1[i][0] += ALPHA * delta_i;
#pragma omp simd
for(int j=1;j<L1_DIM;j++){
WL1[i][j] += ALPHA * delta_i * vector_in[j-1]; //equation I
}
}<LO... |
n-roussos/Parallel-Programming-with-OpenMP/4. Neural networks/NN4/NN4.2.c | #pragma omp parallel for private(max,predicted_class, OL1, OL2) | 100 | hts(vector_in);
}
double train_accuracy(void){
double max;
int predicted_class, correct = 0;
//<LOOP-START>for(int i=0;i<TRAIN_EXAMPLES;i++){
activate_NN(TRAIN_DATA[i]); //predict
max = OL2[0];
predicted_class = 0;
for(int j=1;j<L2_NEURONS;j++){
if(OL2[j] > max){
max = OL2[j];
predicted_class = ... |
rahulsonone1234/Parallel-Programming/ContrastStretchingImageParallel.c | #pragma omp parallel for | 100 | png_destroy_write_struct(&png, &info);
}
int main()
{
double startTime = omp_get_wtime();
<LOOP-START>for(int i=1;i<=800;i++)
{
char str[25]="cat (";
char out[25]="out (";
int a=i;
int tmp=i;
int cnt=0;
while(tmp)
{
... |
rahulsonone1234/Parallel-Programming/LoGParallel.c | #pragma omp parallel for | 100 | ng_destroy_write_struct(&png, &info);
}
int main() {
double startTime = omp_get_wtime();
<LOOP-START>for(int i=1;i<=4;i++)
{
char str[25]="cat (";
char out[25]="out (";
int a=i;
int tmp=i;
int cnt=0;
while(tmp)
{
... |
rahulsonone1234/Parallel-Programming/EdgeDetectionfinalparallel.c | #pragma omp parallel for | 100 | ng_destroy_write_struct(&png, &info);
}
int main() {
double startTime = omp_get_wtime();
<LOOP-START>for(int i=1;i<=800;i++)
{
char str[25]="cat (";
char out[25]="out (";
int a=i;
int tmp=i;
int cnt=0;
while(tmp)
{
... |
rahulsonone1234/Parallel-Programming/negationImageParallel.c | #pragma omp parallel for | 100 |
png_destroy_write_struct(&png, &info);
}
int main()
{
double startTime = omp_get_wtime();
<LOOP-START>for(int i=1;i<=4;i++)
{
char str[25]="cat (";
char out[25]="out (";
int a=i;
int tmp=i;
int cnt=0;
while(tmp)
{
tmp=tmp/10;
cnt++;
}
int j=cnt-1;
char pok[25]=").png";
char lok[25... |
mghojal/Edge-detection-using-laplacian-operator/header.h | #pragma omp parallel for collapse(2) | 100 |
int x,y;
// for each row, column, calculating the new value using Stencil Matrix (laplacian)
<LOOP-START>for ( y = 1; y < in->height-2; y++ ) {
for( x = 1; x < in->width-2; x++ ) {
double val = abs(
8 * image_get_pixeld(in, x, y) -(
image_get_pixeld(in, x-1, y-1 ) +
image_get_pixeld(in, x , y-1 )... |
mghojal/Edge-detection-using-laplacian-operator/header.h | #pragma omp parallel for collapse(2) | 100 | n ) min = val;
}
}
}
//Normailzing the values and set pixel value in the proper location
<LOOP-START>for ( y = 0; y < in->height; y++ ) {
for( x = 0; x < in->width; x++ ) {
double val = MAX_BRIGHTNESS * (buffer[y*in->width+x] - min) / (max-min);
image_set_pixel( out, x, y, val );
}
}<LOOP-END> <OM... |
mghojal/Edge-detection-using-laplacian-operator/header.h | #pragma omp parallel for collapse(2) | 100 | fo_ptr);
width = png_get_image_width(png_ptr, info_ptr);
image = image_create( width, height );
<LOOP-START>for ( y = 0; y < height; y++ ) {
for( x = 0; x < width; x++ ) {
unsigned c = 0;
unsigned char* ch = (unsigned char*)&c;
unsigned char* array = row_pointers[y];
ch[0] = array[x];
image_set_pi... |
nathanlo99/nart/src/raytracer.cpp | #pragma omp parallel for schedule(guided) collapse(2) | 100 | _pixels = screen_height * screen_width;
size_t num_processed = 0;
auto last_ms = milli_time();
<LOOP-START>for (size_t y = 0; y < screen_height; y++) {
for (size_t x = 0; x < screen_width; x++) {
vec3 result_colour = vec3();
for (size_t i = 0; i < aa_num * aa_num; i++) {
const float rx = (i... |
vlkale/lw-sched/oldExamples/appFor_vSched-omp.C | #pragma omp parallel for | 100 | )malloc(sizeof(float)*probSize);
// initialize input vectors, use standard worksharing here.
<LOOP-START>for (int i = 0 ; i < probSize ; i++)
{
a[i] = i*1.0;
b[i] = 1.0;
#ifdef VERBOSE
int myTid = omp_get_thread_num();
printf("tid in init = %d", myTid);
}<LOOP-END> <OMP-START>#pragma omp par... |
vlkale/lw-sched/oldExamples/app2For_vSched-omp.C | #pragma omp parallel for | 100 | )malloc(sizeof(float)*probSize);
// initialize input vectors, use standard worksharing here.
<LOOP-START>for (int i = 0 ; i < probSize ; i++)
{
a[i] = i*1.0;
b[i] = 1.0;
#ifdef VERBOSE
int myTid = omp_get_thread_num();
printf("tid in init = %d", myTid);
}<LOOP-END> <OMP-START>#pragma omp par... |
vlkale/lw-sched/oldExamples/appFor-OpenMP-vSched.C | #pragma omp parallel for | 100 | )malloc(sizeof(float)*probSize);
// initialize input vectors, use standard worksharing here.
<LOOP-START>for (int i = 0 ; i < probSize ; i++)
{
a[i] = i*1.0;
b[i] = 1.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
vlkale/lw-sched/examples/appFor_omp-lols.C | #pragma omp parallel for | 100 | )malloc(sizeof(float)*probSize);
// initialize input vectors, use standard worksharing here.
<LOOP-START>for (int i = 0 ; i < probSize ; i++)
{
a[i] = i*1.0;
b[i] = 1.0;
#ifdef VERBOSE
int myTid = omp_get_thread_num();
printf("tid in init = %d", myTid);
}<LOOP-END> <OMP-START>#pragma omp par... |
vlkale/lw-sched/tests/perf/testOneFor_omp-lols.C | #pragma omp parallel for | 100 | )malloc(sizeof(float)*probSize);
// initialize input vectors, use standard worksharing here.
<LOOP-START>for (int i = 0 ; i < probSize ; i++)
{
a[i] = i*1.0;
b[i] = 1.0;
#ifdef VERBOSE
int myTid = omp_get_thread_num();
printf("tid in init = %d", myTid);
}<LOOP-END> <OMP-START>#pragma omp par... |
vlkale/lw-sched/share/ukernels/mandelbrot-hybrid.cpp | #pragma omp parallel for private(i, j) | 100 | me start of %d\n",iproc,myRecvArr[0]);
myJobStart = myRecvArr[0];
// do work
<LOOP-START>for (j = 0; j < BLOCK_HEIGHT; j++) {
for (i = 0; i < BLOCK_WIDTH; i++) {
pixels[i + j * BLOCK_WIDTH] = computePoint(i, j + myJobStart / 1536);
//fprintf(stderr,"%d ",pixels[i + j * BLOCK_WIDT... |
vlkale/lw-sched/share/ukernels/heat-mpi.cpp | #pragma omp parallel for | 100 | need ghost values of X but we'll throw them in
// as X[0] and X[N+1].
//
x = new double[n+2];
<LOOP-START>for ( i = 0; i <= n + 1; i++ )
{
x[i] = ( ( double ) ( id * n + i - 1 ) * x_max
+ ( double ) ( p * n - id * n - i ) * x_min )
/ ( double ) ( p * n - 1 );
... |
vlkale/lw-sched/share/ukernels/heat-mpi.cpp | #pragma omp parallel for | 100 | LD, &status );
#endif
}
//
// Update the temperature based on the four point stencil.
//
<LOOP-START>for ( i = 1; i <= n; i++ )
{
h_new[i] = h[i]
+ ( time_delta * k / x_delta / x_delta ) * ( h[i-1] - 2.0 * h[i] + h[i+1] )
+ time_delta * rhs ( x[i], time );
}<LOOP-END> <OMP-START>#... |
vlkale/lw-sched/share/ukernels/matVec-mpi.c | #pragma omp parallel for | 100 | alloc ( n * sizeof ( double ) );
b = ( double * ) malloc ( m * sizeof ( double ) );
k = 0;
<LOOP-START>for ( i = 1; i <= m; i++ )
{
for ( j = 1; j <= n; j++ )
{
a[k] = sqrt ( 2.0 / ( double ) ( n + 1 ) )
* sin ( ( double ) ( i * j ) * pi / ( double ) ( n + 1 ) );
k =... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.