filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
ENCCS/intermediate-mpi/content/code/day-4/02_threading-multiple/solution/threading-multiple.c | #pragma omp parallel for | 100 | cal computation. OpenMP will distribute each
* iteration to a different thread. */
<LOOP-START>for (int k = 0; k != 2; k = k + 1)
{
compute_row(local_work[k], working_data_set, next_working_data_set);
}<LOOP-END> <OMP-START>#pragma omp parallel fo... |
ENCCS/intermediate-mpi/content/code/day-4/02_threading-multiple/solution/threading-multiple.c | #pragma omp parallel for | 100 | * iteration to a different thread. */
int non_local_work[] = {1, 4};
<LOOP-START>for (int k = 0; k != 2; k = k + 1)
{
compute_row(non_local_work[k], working_data_set, next_working_data_set);
}<LOOP-END> <OMP-START>#pragma omp paralle... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | r(size_t i=0; i < particleVec.size(); i++)
{
double densityVal = 0;
<LOOP-START>for(size_t j = 0; j < particleVec[i].neighbours.size(); j++)
{
if(i == particleVec[i].neighbours[j])continue;
const Helper::Point3D diffParticleNeighbour = particle... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | }
}
void IISPHForces::compute_gravity_force(ParticleVec& particleVec)
{
<LOOP-START>for(auto& particle: particleVec)
{
particle.fGravity = Config::GravitationalAcceleration * particle.mass;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | }
}
void IISPHForces::compute_advection_forces(ParticleVec& particleVec)
{
<LOOP-START>for(auto& particle: particleVec)
{
particle.fAdvection = particle.fGravity;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | }
}
void IISPHForces::compute_predicted_velocity(ParticleVec& particleVec)
{
<LOOP-START>for(auto& particle: particleVec)
{
particle.predicted_velocity = particle.velocity + Config::timestep*particle.fAdvection/particle.mass;
}<LOOP-END> <OMP-START>#pragma omp parallel... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | cle.mass;
}
}
void IISPHForces::compute_DII(ParticleVec& particleVec)
{
<LOOP-START>for(size_t i=0; i < particleVec.size(); i++)
{
Helper::Point3D finalDII = Helper::Point3D(0,0,0);
#pragma omp parallel for
for(size_t j=0; j< particleVec[i].neighb... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | c.size(); i++)
{
Helper::Point3D finalDII = Helper::Point3D(0,0,0);
<LOOP-START>for(size_t j=0; j< particleVec[i].neighbours.size(); j++)
{
if(i == particleVec[i].neighbours[j])continue;
const Helper::Point3D diffParticleNeighbour = particleVec... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | Point3D diffParticleNeighbour = pV[i].position - pV[pV[i].neighbours[j]].position;
<LOOP-START>if(Config::SupportRadius - diffParticleNeighbour.calcNorm() > DBL_EPSILON && diffParticleNeighbour.calcNorm()!=0)
{
pV[i].predicted_density += Config::timestep* pV[pV[i].n... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | Point3D diffParticleNeighbour = pV[i].position - pV[pV[i].neighbours[j]].position;
<LOOP-START>if(Config::SupportRadius - diffParticleNeighbour.calcNorm() > DBL_EPSILON && diffParticleNeighbour.calcNorm()!=0)
{
Helper::Point3D dji = -1 * Config::timestep * Config::ti... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | cleVec& particleVec, int i)
{
Helper::Point3D sumDIJ = Helper::Point3D(0,0,0);
<LOOP-START>for(size_t j=0; j< particleVec[i].neighbours.size(); j++)
{
if(i == particleVec[i].neighbours[j])continue;
particleVec[particleVec[i].neighbours[j]].prev_iterate_pressure = par... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | ize(); i++)
{
double corr_density=0.0;
<LOOP-START>for(size_t j=0; j< pV[i].neighbours.size(); j++)
{
if(i==pV[i].neighbours[j])continue;
const Helper::Point3D diffParticleNeighbour = pV[pV[i].neighbours... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | ble IISPHForces::ErrorDensity(ParticleVec& particleVec)
{
double avg_density=0;
<LOOP-START>for(size_t i=0; i< particleVec.size(); i++)
{
avg_density += particleVec[i].corrected_density ;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | ce(ParticleVec& pV, int i)
{
Helper::Point3D forceSum = Helper::Point3D(0,0,0);
<LOOP-START>for(size_t j=0; j < pV[i].neighbours.size(); j++)
{
if(i == pV[i].neighbours[j])continue;
const Helper::Point3D diffParticleNeighbour = pV[i].position - pV[pV[i].neighbours[j]]... |
agam-kashyap/Fluid-Simulation-Rendering/Simulation/src/iisph-forces.cpp | #pragma omp parallel for | 100 | * -1 * pV[i].mass;
}
void IISPHForces::integration(ParticleVec& particleVec)
{
<LOOP-START>for(size_t i=0; i < particleVec.size(); i++)
{
if(std::isnan(particleVec[i].velocity.x) || std::isnan(particleVec[i].velocity.y) || std::isnan(particleVec[i].velocity.z))
{
... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | rintf ("Number of Threads counted = %i\n",k);
#endif
/* Get initial value for system clock. */
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++) {
a[j] = 1.0;
b[j] = 2.0;
c[j] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | rity appears to be "
"less than one microsecond.\n");
quantum = 1;
}
t = mysecond();
<LOOP-START>for (j = 0; j < STREAM_ARRAY_SIZE; j++)
a[j] = 2.0E0 * a[j];
t = 1.0E6 * (mysecond() - t);
printf("Each test below will take on the order"
" of %d microseconds.\n", (int) t );
printf(" (= %... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | (k=0; k<NTIMES; k++)
{
times[0][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Copy();
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
times[0][k] = mysecond() - times[0][k];
times[1][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Scale(scalar);
#else
#pragma omp parallel for
fo... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | - times[0][k];
times[1][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Scale(scalar);
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
times[1][k] = mysecond() - times[1][k];
times[2][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Add();
#else
#pragma omp parallel for
for... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | second() - times[1][k];
times[2][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Add();
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
times[2][k] = mysecond() - times[2][k];
times[3][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Triad(scalar);
#else
#pragma omp parallel fo... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | - times[2][k];
times[3][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Triad(scalar);
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[j];
times[3][k] = mysecond() - times[3][k];
}
/* --- SUMMARY --- */
for (k=1; k<NTIMES; k++) /* note -- skip first iteration */
{
f... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | #ifdef TUNED
/* stubs for "tuned" versions of the kernels */
void tuned_STREAM_Copy()
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
}
void tuned_STREAM_Scale(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | AY_SIZE; j++)
c[j] = a[j];
}
void tuned_STREAM_Scale(STREAM_TYPE scalar)
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
}
void tuned_STREAM_Add()
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
}<LOOP-END> <OMP-STAR... |
hermit-os/libhermit/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | r (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
}
void tuned_STREAM_Add()
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
}
void tuned_STREAM_Triad(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[... |
hermit-os/libhermit/usr/openmpbench/syncbench.c | #pragma omp parallel for | 100 | Y
static int n = 1;
XRayAnnotate("n = %i", n);
n++;
#endif
for (j = 0; j < innerreps; j++) {
<LOOP-START>for (i = 0; i < nthreads; i++) {
delay(delaylength);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
hermit-os/libhermit/usr/openmpbench/syncbench.c | #pragma omp parallel for ordered schedule (static,1) | 100 | ck);
delay(delaylength);
omp_unset_lock(&lock);
}
}
}
void testorder() {
int j;
<LOOP-START>for (j = 0; j < (int)innerreps; j++) {
#pragma omp ordered
delay(delaylength);
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered schedule (static,1)<OMP-END> |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | rintf ("Number of Threads counted = %i\n",k);
#endif
/* Get initial value for system clock. */
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++) {
a[j] = 1.0;
b[j] = 2.0;
c[j] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | rity appears to be "
"less than one microsecond.\n");
quantum = 1;
}
t = mysecond();
<LOOP-START>for (j = 0; j < STREAM_ARRAY_SIZE; j++)
a[j] = 2.0E0 * a[j];
t = 1.0E6 * (mysecond() - t);
printf("Each test below will take on the order"
" of %d microseconds.\n", (int) t );
printf(" (= %... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | (k=0; k<NTIMES; k++)
{
times[0][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Copy();
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
times[0][k] = mysecond() - times[0][k];
times[1][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Scale(scalar);
#else
#pragma omp parallel for
fo... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | - times[0][k];
times[1][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Scale(scalar);
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
times[1][k] = mysecond() - times[1][k];
times[2][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Add();
#else
#pragma omp parallel for
for... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | second() - times[1][k];
times[2][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Add();
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
times[2][k] = mysecond() - times[2][k];
times[3][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Triad(scalar);
#else
#pragma omp parallel fo... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | - times[2][k];
times[3][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Triad(scalar);
#else
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[j];
times[3][k] = mysecond() - times[3][k];
}
/* --- SUMMARY --- */
for (k=1; k<NTIMES; k++) /* note -- skip first iteration */
{
f... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | #ifdef TUNED
/* stubs for "tuned" versions of the kernels */
void tuned_STREAM_Copy()
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
}
void tuned_STREAM_Scale(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | AY_SIZE; j++)
c[j] = a[j];
}
void tuned_STREAM_Scale(STREAM_TYPE scalar)
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
}
void tuned_STREAM_Add()
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
}<LOOP-END> <OMP-STAR... |
hermit-os/hermit-playground/usr/benchmarks/stream.c | #pragma omp parallel for | 100 | r (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
}
void tuned_STREAM_Add()
{
ssize_t j;
<LOOP-START>for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
}
void tuned_STREAM_Triad(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[... |
hermit-os/hermit-playground/usr/openmpbench/syncbench.c | #pragma omp parallel for | 100 | Y
static int n = 1;
XRayAnnotate("n = %i", n);
n++;
#endif
for (j = 0; j < innerreps; j++) {
<LOOP-START>for (i = 0; i < nthreads; i++) {
delay(delaylength);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
hermit-os/hermit-playground/usr/openmpbench/syncbench.c | #pragma omp parallel for ordered schedule (static,1) | 100 | ck);
delay(delaylength);
omp_unset_lock(&lock);
}
}
}
void testorder() {
int j;
<LOOP-START>for (j = 0; j < (int)innerreps; j++) {
#pragma omp ordered
delay(delaylength);
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered schedule (static,1)<OMP-END> |
RIKEN-SysSoft/mckernel/test/uti/CT30.c | #pragma omp parallel for | 100 | "Error: pthread_create: %s\n", strerror(errno));
exit(1);
}
}
pthread_barrier_wait(&bar);
<LOOP-START>for (i = 0; i < omp_get_num_threads(); i++) {
printf("[INFO] thread_num=%d,tid=%d\n", i, syscall(SYS_gettid));
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
RIKEN-SysSoft/mckernel/test/uti/mpi/011.c | #pragma omp parallel for | 100 | memset(recvv[i], 0, szentry);
}
printf("after memset\n");
print_cpu_last_executed_on("main");
<LOOP-START>for (i = 0; i < omp_get_num_threads(); i++) {
printf("thread_num=%d,tid=%d\n", i, syscall(SYS_gettid));
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/oshmpi/tests/stream_omp.c | #pragma omp parallel for num_threads(NTHREADS) | 100 | r (j = 0; j < STREAM_ARRAY_SIZE; j += blocksize)
{
if (next_p == count_p)
{
#ifdef _OPENMP
<LOOP-START>#ifdef __INTEL_COMPILER
#pragma vector aligned
#pragma ivdep
for (i = j; i < (j + blocksize); i++)
{
a[i] = 1.0;
b[i] = 2.0;
c[i] = 0.0;
a[i] = 2.0E0 * a[i];
}<LOOP-END> <OMP-STAR... |
jeffhammond/oshmpi/tests/stream_omp.c | #pragma omp parallel for num_threads(NTHREADS) | 100 | (j = 0; j < STREAM_ARRAY_SIZE; j += blocksize)
{
if (next_p == count_p)
{
#ifdef _OPENMP
<LOOP-START>#ifdef __INTEL_COMPILER
#pragma vector aligned
#pragma ivdep
for (i = j; i < (j + blocksize); i++)
{
c[i] = a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(NTHREADS)<OMP-END> |
jeffhammond/oshmpi/tests/stream_omp.c | #pragma omp parallel for num_threads(NTHREADS) | 100 | r (j = 0; j < STREAM_ARRAY_SIZE; j += blocksize)
{
if (next_p == count_p)
{
#ifdef _OPENMP
<LOOP-START>#ifdef __INTEL_COMPILER
#pragma vector aligned
#pragma ivdep
for (i = j; i < (j + blocksize); i++)
{
b[i] = scalar * c[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(NTHREADS)... |
jeffhammond/oshmpi/tests/stream_omp.c | #pragma omp parallel for num_threads(NTHREADS) | 100 | r (j = 0; j < STREAM_ARRAY_SIZE; j += blocksize)
{
if (next_p == count_p)
{
#ifdef _OPENMP
<LOOP-START>#ifdef __INTEL_COMPILER
#pragma vector aligned
#pragma ivdep
for (i = j; i < (j + blocksize); i++)
{
c[i] = a[i] + b[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(NTHREADS)<O... |
jeffhammond/oshmpi/tests/stream_omp.c | #pragma omp parallel for num_threads(NTHREADS) | 100 | r (j = 0; j < STREAM_ARRAY_SIZE; j += blocksize)
{
if (next_p == count_p)
{
#ifdef _OPENMP
<LOOP-START>#ifdef __INTEL_COMPILER
#pragma vector aligned
#pragma ivdep
for (i = j; i < (j + blocksize); i++)
{
a[i] = b[i] + scalar * c[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(NT... |
jeffhammond/HPCInfo/simd/simd-memtest/util.c | #pragma omp parallel for reduction(+:errors) | 100 | re_doubles(size_t n, const double * RESTRICT x, const double * RESTRICT y)
{
size_t errors = 0;
<LOOP-START>for (size_t i=0; i<n; i++) {
if (x[i] != y[i]) errors++;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:errors)<OMP-END> |
jeffhammond/HPCInfo/simd/simd-memtest/util.c | #pragma omp parallel for reduction(+:errors) | 100 | ize_t n, const double * RESTRICT x, const double * RESTRICT y, int stride)
{
size_t errors = 0;
<LOOP-START>for (size_t i=0; i<n; i+=stride) {
if (x[i] != y[i]) errors++;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:errors)<OMP-END> |
jeffhammond/HPCInfo/simd/simd-memtest/util.c | #pragma omp parallel for reduction(+:errors) | 100 | st double * RESTRICT x, const double * RESTRICT y, int stride, double val)
{
size_t errors = 0;
<LOOP-START>for (size_t i=0; i<n; i+=stride) {
/* check the part that is copied */
if (y[i] != x[i]) errors++;
/* between the strides, elements should not change */
for (int s=1; s<stride ... |
jeffhammond/HPCInfo/simd/simd-memtest/util.c | #pragma omp parallel for | 100 | errors++;
}
}
return errors;
}
void init_doubles(size_t n, double * RESTRICT x)
{
<LOOP-START>for (size_t i=0; i<n; i++) {
x[i] = (double)i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/simd/simd-memtest/util.c | #pragma omp parallel for | 100 |
x[i] = (double)i;
}
}
void set_doubles(size_t n, double value, double * RESTRICT x)
{
<LOOP-START>for (size_t i=0; i<n; i++) {
x[i] = value;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 | eof(double) );
B = safemalloc( N * sizeof(double) );
int k = 0;
#ifdef OMP
<LOOP-START>for ( int i=0 ; i<n ; i++ )
for ( int j=0 ; j<n ; j++ )
A[i*n+j] = (double)(k++);
#ifdef OMP
#pragma omp parallel for if(n>OMP_MIN_SIZE)
for ( int i=0 ; i<n ;... |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 | for ( int j=0 ; j<n ; j++ )
A[i*n+j] = (double)(k++);
#ifdef OMP
<LOOP-START>for ( int i=0 ; i<n ; i++ )
for ( int j=0 ; j<n ; j++ )
B[i*n+j] = 0.0;
/* reference - memcpy */
t0 = getticks();
for ( int t=0 ; t<REP... |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 |
t0 = getticks();
for ( int t=0 ; t<REPEAT ; t++ )
{
#ifdef OMP
<LOOP-START>for ( int i=0 ; i<n ; i++ )
for ( int j=0 ; j<n ; j++ )
B[i*n+j] = A[i*n+j];
}
t1 = getticks();
d1[n] = (t1-t0)/REPEAT;
... |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 |
t0 = getticks();
for ( int t=0 ; t<REPEAT ; t++ )
{
#ifdef OMP
<LOOP-START>for ( int i=0 ; i<n ; i++ )
for ( int j=0 ; j<n ; j++ )
B[i*n+j] = A[j*n+i];
}
t1 = getticks();
d2[n] = (t1-t0)/REPEAT;
... |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 |
t0 = getticks();
for ( int t=0 ; t<REPEAT ; t++ )
{
#ifdef OMP
<LOOP-START>for ( int j=0 ; j<n ; j++ )
for ( int i=0 ; i<n ; i++ )
B[i*n+j] = A[j*n+i];
}
t1 = getticks();
d3[n] = (t1-t0)/REPEAT;
... |
jeffhammond/HPCInfo/tuning/transpose/transpose.c | #pragma omp parallel for if(n>OMP_MIN_SIZE) | 100 | s1 loads */
t0 = getticks();
for ( int t=0 ; t<REPEAT ; t++ ) {
#ifdef OMP
<LOOP-START>//#pragma unroll(4)
#pragma unroll_and_jam
for ( int j=0 ; j<n ; j++ )
//#pragma unroll(4)
#pragma unroll_and_jam
fo... |
jeffhammond/HPCInfo/openmp/distribute.c | #pragma omp parallel for | 100 | */
int main(int argc, char* argv[])
{
#ifdef DISTRIBUTE
#pragma omp distribute parallel for
#else
<LOOP-START>for (int i=0; i<100; i++) {
printf("tid=%d\n", omp_get_thread_num());
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/openmp/matrix.c | #pragma omp parallel for | 100 | A!=NULL);
assert(B!=NULL);
assert(C!=NULL);
double t0, t1;
#pragma omp parallel
{
<LOOP-START>for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
A[i*n+j] = 1.0/(i+j+1);
#pragma omp parallel for
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
B[i*n+j] = 1.0... |
jeffhammond/HPCInfo/openmp/matrix.c | #pragma omp parallel for | 100 | for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
A[i*n+j] = 1.0/(i+j+1);
<LOOP-START>for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
B[i*n+j] = 1.0/(i+j+1);
#pragma omp parallel for
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
C[i*n+j] = 0.0... |
jeffhammond/HPCInfo/openmp/matrix.c | #pragma omp parallel for | 100 | for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
B[i*n+j] = 1.0/(i+j+1);
<LOOP-START>for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
C[i*n+j] = 0.0;
t0 = omp_get_wtime();
#pragma omp parallel for
for (int k=0; k<n; k++)
for (int i=0; i<n; i++)
... |
jeffhammond/HPCInfo/openmp/matrix.c | #pragma omp parallel for | 100 | <n; i++)
for (int j=0; j<n; j++)
C[i*n+j] = 0.0;
t0 = omp_get_wtime();
<LOOP-START>for (int k=0; k<n; k++)
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
C[i*n+j] += A[i*n+k] * B[k*n+j];
t1 = omp_get_wtime();
}
double x = 0.0;
#pragma omp p... |
jeffhammond/HPCInfo/openmp/matrix.c | #pragma omp parallel for | 100 | C[i*n+j] += A[i*n+k] * B[k*n+j];
t1 = omp_get_wtime();
}
double x = 0.0;
<LOOP-START>for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
{
//printf("C(%d,%d) = %lf \n", i, j, C[i*n+j]);
x += C[i*n+j];
}<LOOP-END> <OMP-START>#pragma omp parallel fo... |
jeffhammond/HPCInfo/openmp/stl.cc | #pragma omp parallel for | 100 | uble> A(1000);
#if 0
#pragma omp workshare
std::iota(A.begin(), A.end(), 0.0);
#endif
<LOOP-START>std::for_each( std::begin(A), std::end(A), [&] (double x) { std::cout << x; }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/openmp/offload/test_vadd_4.c | #pragma omp parallel for simd | 100 | STRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_OPENMP >= 201307)
<LOOP-START>#elif defined(_OPENMP)
#warning No OpenMP simd support!
#pragma omp parallel for
#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_4.c | #pragma omp parallel for | 100 | )
#pragma omp parallel for simd
#elif defined(_OPENMP)
#warning No OpenMP simd support!
<LOOP-START>#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_O... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_4.c | #pragma omp parallel for simd | 100 | a[0:n],b[0:n]) map(from:c[0:n])
#pragma omp target map(to:n,a[0:n],b[0:n]) map(from:c[0:n])
<LOOP-START>#else
#warning No OpenMP target/simd support!
#pragma omp parallel for
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd3(int n, float * RESTRICT a, float * RESTRICT b, float * ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_4.c | #pragma omp parallel for | 100 | rom:c[0:n])
#pragma omp parallel for simd
#else
#warning No OpenMP target/simd support!
<LOOP-START>for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd3(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#ifdef __cilk
_Cilk_for(int i = 0; i < n; i++)
#else
#warning ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_2.c | #pragma omp parallel for simd | 100 | STRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_OPENMP >= 201307)
<LOOP-START>#elif defined(_OPENMP)
#warning No OpenMP simd support!
#pragma omp parallel for
#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_2.c | #pragma omp parallel for | 100 | )
#pragma omp parallel for simd
#elif defined(_OPENMP)
#warning No OpenMP simd support!
<LOOP-START>#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_O... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_2.c | #pragma omp parallel for simd | 100 | a[0:n],b[0:n]) map(from:c[0:n])
#pragma omp target map(to:n,a[0:n],b[0:n]) map(from:c[0:n])
<LOOP-START>#else
#warning No OpenMP target/simd support!
#pragma omp parallel for
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
int main(int argc, char * argv[])
{
int n = (argc > 1 ) ? atoi... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_2.c | #pragma omp parallel for | 100 | rom:c[0:n])
#pragma omp parallel for simd
#else
#warning No OpenMP target/simd support!
<LOOP-START>for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
int main(int argc, char * argv[])
{
int n = (argc > 1 ) ? atoi(argv[1]) : 1000;
float * x = calloc(n,sizeof(float)); assert(x !=NULL);
fl... |
jeffhammond/HPCInfo/openmp/offload/test_memory_model.c | #pragma omp parallel for | 100 | #pragma omp parallel
#pragma omp master
{
#pragma omp task
{
<LOOP-START>for (int i=0; i<100000; i++) {
#pragma omp atomic update
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/openmp/offload/test_memory_model.c | #pragma omp parallel for | 100 | ragma omp task
{
#pragma omp target map(tofrom:x)
{
<LOOP-START>for (int i=0; i<100000; i++) {
#pragma omp atomic update
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/openmp/offload/test_syscall.c | #pragma omp parallel for | 100 | sched.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#if 1
void foo(void)
{
#pragma omp target
<LOOP-START>for (int i=0; i<1; i++)
sched_yield();
}
#if 0
void foo(void)
{
#pragma omp target
#pragma omp parallel for
for (int i=0; i<1; i++)
printf("Bob W is great.\n");
}<LOOP-END> <OMP-START>#p... |
jeffhammond/HPCInfo/openmp/offload/test_syscall.c | #pragma omp parallel for | 100 | (int i=0; i<1; i++)
sched_yield();
}
#endif
#if 0
void foo(void)
{
#pragma omp target
<LOOP-START>for (int i=0; i<1; i++)
printf("Bob W is great.\n");
}
#if 0
void foo(void)
{
#pragma omp target
#pragma omp parallel for
for (int i=0; i<1; i++)
puts("Rolf R is great\n");
}<LOOP-END> <... |
jeffhammond/HPCInfo/openmp/offload/test_syscall.c | #pragma omp parallel for | 100 | ; i++)
printf("Bob W is great.\n");
}
#endif
#if 0
void foo(void)
{
#pragma omp target
<LOOP-START>for (int i=0; i<1; i++)
puts("Rolf R is great\n");
}
int main(int argc, char * argv[])
{
foo();
printf("Success\n");
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
jeffhammond/HPCInfo/openmp/offload/test_vadd.c | #pragma omp parallel for simd | 100 | STRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_OPENMP >= 201307)
<LOOP-START>#elif defined(_OPENMP)
#warning No OpenMP simd support!
#pragma omp parallel for
#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd.c | #pragma omp parallel for | 100 | )
#pragma omp parallel for simd
#elif defined(_OPENMP)
#warning No OpenMP simd support!
<LOOP-START>#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_O... |
jeffhammond/HPCInfo/openmp/offload/test_vadd.c | #pragma omp parallel for simd | 100 | to:n,a[0:n],b[0:n]) map(from:c[0:n])
# if defined(__INTEL_COMPILER) && defined(__INTEL_OFFLOAD)
<LOOP-START># else
#pragma omp teams distribute parallel for simd
# endif
#else
#warning No OpenMP target/simd support!
#pragma omp parallel for
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
... |
jeffhammond/HPCInfo/openmp/offload/test_vadd.c | #pragma omp parallel for | 100 | mp teams distribute parallel for simd
# endif
#else
#warning No OpenMP target/simd support!
<LOOP-START>for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd3(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#ifdef __cilk
_Cilk_for(int i = 0; i < n; i++)
#else
#warning ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_1.c | #pragma omp parallel for simd | 100 | STRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_OPENMP >= 201307)
<LOOP-START>#elif defined(_OPENMP)
#warning No OpenMP simd support!
#pragma omp parallel for
#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, ... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_1.c | #pragma omp parallel for | 100 | )
#pragma omp parallel for simd
#elif defined(_OPENMP)
#warning No OpenMP simd support!
<LOOP-START>#else
#warning No OpenMP support!
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
void vadd2(int n, float * RESTRICT a, float * RESTRICT b, float * RESTRICT c)
{
#if defined(_OPENMP) && (_O... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_1.c | #pragma omp parallel for simd | 100 | a[0:n],b[0:n]) map(from:c[0:n])
#pragma omp target map(to:n,a[0:n],b[0:n]) map(from:c[0:n])
<LOOP-START>#else
#warning No OpenMP target/simd support!
#pragma omp parallel for
for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
int main(int argc, char * argv[])
{
int n = (argc > 1 ) ? atoi... |
jeffhammond/HPCInfo/openmp/offload/test_vadd_1.c | #pragma omp parallel for | 100 | rom:c[0:n])
#pragma omp parallel for simd
#else
#warning No OpenMP target/simd support!
<LOOP-START>for(int i = 0; i < n; i++)
c[i] = a[i] + b[i];
}
int main(int argc, char * argv[])
{
int n = (argc > 1 ) ? atoi(argv[1]) : 1000;
float * x = calloc(n,sizeof(float)); assert(x !=NULL);
fl... |
jeffhammond/HPCInfo/atomics/gpu/basic.cc | #pragma omp parallel for | 100 | ble> rd{d};
#endif
#define ALSO_NO 1
int main(void)
{
const int n{10000};
#ifdef _OPENMP
<LOOP-START>#else
#pragma acc parallel loop
for (int i=0; i<n; ++i) {
ai++;
af.fetch_add(1.0f);
ad.fetch_add(1.0);
ri++;
rf.fetch_add(1.0f);
rd.fetch_add(1.0);
... |
AndreiCNitu/HPC/lattice-boltzmann/openMP/lbm.c | #pragma omp parallel for reduction(+:tot_u), reduction(+:tot_cells) | 100 | ; /* accumulated magnitudes of velocity for each cell */
/* loop over the cells in the grid */
<LOOP-START>for (int jj = 0; jj < params.ny; jj++) {
__assume_aligned(cells->speed_0, 64);
__assume_aligned(cells->speed_1, 64);
__assume_aligned(cells->speed_2, 64);
__assume_aligned(cells->speed_3, 64);... |
AndreiCNitu/HPC/lattice-boltzmann/openMP/lbm.c | #pragma omp parallel for | 100 | * 4.f / 9.f;
float w1 = params->density / 9.f;
float w2 = params->density / 36.f;
<LOOP-START>for (int jj = 0; jj < params->ny; jj++) {
for (int ii = 0; ii < params->nx; ii++) {
/* centre */
(*cells_ptr)->speed_0[ii + jj*params->nx] = w0;
/* axis directions */
(*cells_ptr)-... |
AndreiCNitu/HPC/lattice-boltzmann/openMP/lbm.c | #pragma omp parallel for | 100 | peed_8[ii + jj*params->nx] = w2;
}
}
/* first set all cells in obstacle array to zero */
<LOOP-START>for (int jj = 0; jj < params->ny; jj++) {
for (int ii = 0; ii < params->nx; ii++) {
(*obstacles_ptr)[ii + jj*params->nx] = 0;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
Dainerx/parallel-distributed-computing-C/applying_functions.c | #pragma omp parallel for | 100 | ();
//start parallel
//printf("thread number %d\n",omp_get_thread_num());
<LOOP-START>for(i=0; i<n; i++)
{
//tt[i] = f(tt[i]); //O(1)
tt[i] = f1(tt[i]); //the speed up is much higher with f1 since log and cos computations are polynomial; see function.
}<... |
Dainerx/parallel-distributed-computing-C/PI_estimation.c | #pragma omp parallel for num_threads(nb_threads) private(xi) reduction(+:sum) | 100 | {
long int i;
double pi_value = 0.0;
double sum = 0.0;
double xi, h = (b - a) / N;
<LOOP-START>for (i = 0; i < N; i++) {
xi = a + h*i;
sum += f(xi);
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nb_threads) private(xi) reduction(+:sum) <OMP-END> |
Dainerx/parallel-distributed-computing-C/sum_of_array.c | #pragma omp parallel for reduction(+:sum) | 100 | d_parallel);
sum = 0;
//start parallel with reduction
start_parallel = omp_get_wtime();
<LOOP-START>for (i = 0; i < n; i++) {
//see what index each thread is working on
//printf("thread %d -> %d\n", omp_get_thread_num(), i);
sum += tt[i];
}<LOOP-END> <OMP-START>#pragma omp parall... |
Dainerx/parallel-distributed-computing-C/matrix_addition.c | #pragma omp parallel for collapse(2) | 100 | s of n obviously the speedup will remarkably increase.
double start_parallel = omp_get_wtime();
<LOOP-START>for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
//see which thread handling entry (i,j)
//printf("thread %d working on (%d,%d)\n", omp_get_thread_num(), i, j);
... |
Dainerx/parallel-distributed-computing-C/MultMat/solver.c | #pragma omp parallel for schedule(guided) collapse(2) private(j, k, t, sum) shared(mat_A, mat_B, mat_C) | 100 | t, sum;
omp_set_dynamic(0);
omp_set_num_threads(num_threads);
start = omp_get_wtime();
<LOOP-START>for (i = 0; i < lines_a; i++)
{
for (j = 0; j < columns_b; j++)
{
sum = 0;
for (k = 0; k < columns_a; k++)
{
t = (mat_A[i][k] * mat_B[k]... |
Dainerx/parallel-distributed-computing-C/MultMat/solver.c | #pragma omp parallel for | 100 | nt));
struct FlatArraysCouple flat_array_couple = {a, b};
omp_set_num_threads(num_threads);
<LOOP-START>for (int i = 0; i < lines_a; i++)
{
for (int j = 0; j < columns_a; j++)
{
a[i * columns_a + j] = matrixA[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OM... |
Dainerx/parallel-distributed-computing-C/MultMat/solver.c | #pragma omp parallel for | 100 | 0; j < columns_a; j++)
{
a[i * columns_a + j] = matrixA[i][j];
}
}
<LOOP-START>for (int i = 0; i < lines_b; i++)
{
for (int j = 0; j < columns_b; j++)
{
b[j * lines_b + i] = matrixB[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-... |
Dainerx/parallel-distributed-computing-C/MultMat/mpi_parallelized_scatter_gather.c | #pragma omp parallel for schedule(guided) private(j) shared(a) | 100 | rtMat_parralel(int **matrixA, int **matrixB, int *a, int *b)
{
int i, j;
#pragma omp parallel
{
<LOOP-START>for (i = 0; i < ci.lines_a; i++)
{
for (j = 0; j < ci.columns_a; j++)
{
a[i * ci.columns_a + j] = matrixA[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(gu... |
Dainerx/parallel-distributed-computing-C/MultMat/mpi_parallelized_scatter_gather.c | #pragma omp parallel for schedule(guided) private(j) shared(b) | 100 | = 0; j < ci.columns_a; j++)
{
a[i * ci.columns_a + j] = matrixA[i][j];
}
}
<LOOP-START>for (i = 0; i < ci.lines_b; i++)
{
for (j = 0; j < ci.columns_b; j++)
{
b[j * ci.lines_b + i] = matrixB[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(guid... |
Dainerx/parallel-distributed-computing-C/MultMat/mpi_send_recv.c | #pragma omp parallel for schedule(guided) private(i, j) shared(actual_C, mat_A, mat_B) | 100 | , MPI_INT, root, TAG_MASTER, MPI_COMM_WORLD, &status);
// Every worker's compute its part of matC.
<LOOP-START>for (k = 0; k < ci.columns_b; k++)
for (i = 0; i < rows; i++)
{
actual_C[i][k] = 0.0;
for (j = 0; j < ci.columns_a; j++)
{
... |
xxyux/Distributed-SpMV/DistSpMV_Reordered.c | #pragma omp parallel for | 100 | threads+1) * sizeof(int));
int stridennz = ceil((double)submatrix.nnznum/(double)nthreads);
<LOOP-START>for (int tid = 0; tid <= nthreads; tid++)
{
int boundary = tid * stridennz;
boundary = boundary > submatrix.nnznum ? submatrix.nnznum : boundary;
csrSplitter[tid] = bin... |
xxyux/Distributed-SpMV/DistSpMV_Reordered.c | #pragma omp parallel for | 100 | q++)
{
MPI_Barrier(MPI_COMM_WORLD);
if(id==0) gettimeofday(&t1, NULL);
<LOOP-START>for (int tid = 0; tid < nthreads; tid++)
{
for (int u = csrSplitter[tid]; u < csrSplitter[tid+1]; u++)
{
y[u] = 0;
for (int h = submatrix.rowptr... |
xxyux/Distributed-SpMV/DistSpMV_Reordered.c | #pragma omp parallel for | 100 | usec - t1.tv_usec) / 1000.0);
}
// for (int q = 0; q < NTIMES; q++)
// {
// <LOOP-START>// for (int i=0;i<submatrix.rownum;i++)
// {
// y[i] = 0;
// for (int u = submatrix.rowptr[i];u<submatrix.rowptr[i+1]; u++)
// {
// y[i] += subm... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.