HAMA 블로그

/*#include #include #include #include int num_steps=500000000; #define OPENMPint main(){int i;double x, step, sum = 0.0;step = 1.0/(double) num_steps; boost::timer t; #ifdef NOOPENMPfor (i=0; i

/*#include #include #include #include const int num_steps=100; int main(){boost::timer t; int sum = 0, i = 0;int Data[num_steps] = {0}; for(i =0 ; i < num_steps; i++){Data[i] = i + 1;}#pragma omp parallel for reduction(+:sum)for(i = 0 ; i < num_steps; i++){sum += Data[i];} printf(" 총합 sum = %d \n", sum); double t2_insert = t.elapsed();printf("time: %.8lf \n", t2_insert); return EXIT_SUCCESS;}*/

/*#include #include #include #include int num_steps=100; int main(){boost::timer t; int a = 0;printf("main area / a = %d \n", a);#pragma omp parallel default(none) private(a) // default(shared) {if( omp_get_thread_num() == 0) a = 1;else a = 2; printf("%d thread area / a = %d \n", omp_get_thread_num(), a);} printf("main area / a = %d \n", a);double t2_insert = t.elapsed();printf("time: %.8lf \n",..

/*#include #include #include #include const int num_steps=1000; int main(){boost::timer t; int sum = 0, i = 0; float * Data = new float[num_steps]; for(i =0 ; i < num_steps; i++){Data[i] = i;}float max = 0;#pragma omp parallel for for(i = 0 ; i < num_steps; i++){#pragma omp critical (MAXVALUE){if(max < Data[i])max = Data[i];}} printf(" max = %f \n", max); double t2_insert = t.elapsed();printf("t..