Angler Angler

랭귀지/OpenMP

• [openMP] QuickSort 병렬화

  랭귀지/OpenMP 2012. 9. 20. 15:40

  #include #include #include void setup( int* array, int len ) { int i = 0; #pragma omp parallel for for(i=0; i

  Read More

• [OpenMP] Fibonacci 병렬화

  랭귀지/OpenMP 2012. 9. 20. 15:05

  피보나치 병렬화 실패 #include #include long Sequential_FIB(int n) { long fnm1, fnm2, fn; if(n == 0 || n == 1) return (n); fnm1 = Sequential_FIB(n-1); fnm2 = Sequential_FIB(n-2); fn = fnm1 + fnm2; return (fn); } long openMP_FIB(int n) { long fnm1, fnm2, fn; if(n == 0 || n == 1) return (n); #pragma omp task shared(fnm1) { fnm1 = openMP_FIB(n-1); } #pragma omp task shared(fnm2) { fnm2 = openMP_FIB(n-2); } #..

  Read More

• [OpenMP] SOR( Successive Over Relaxation) 병렬화

  랭귀지/OpenMP 2012. 9. 20. 14:36

  SOR( Successive Over Relaxation) 병렬화 #include #include #define width 256 #define height 256 void Sequential() { double before = omp_get_wtime(); float A[width][height], B[width][height]; int i,j,t; for(i=0; i

  Read More

• [OpenMP] PI 구하기

  랭귀지/OpenMP 2012. 9. 20. 14:20

  PI 구하는 식 병렬화 #include #include static long num_steps = 1000000; double step; void Sequential() { double before = omp_get_wtime(); int i; double x, pi, sum = 0.0; step = 1.0/(double) num_steps; for(i=1; i

  Read More