Paralel.docx
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Paralel.docx as PDF for free.
More details
- Words: 629
- Pages: 8
PEMROGRAMAN PARALLEL
OLEH:
Muthalia Annisa (D42116307)
DEPARTEMEN TEKNIK INFORMATIKA FAKULTAS TEKNIK UNIVERSITAS HASANUDDIN 2019
1. PROGRAM PHI a. Source code #include <stdio.h> #include double sum; int checkParallel = 0; void piP(long num_steps, int red){ sum = 0.0; double runTime, step = 1.0/(double) num_steps, start = omp_get_wtime(); if(red){ #pragma omp for reduction(+:sum) for (int i=1;i<= num_steps; i++){ double x = (i-0.5)*step; sum += 4.0/(1.0+x*x); } }else{ double sumP = 0.0; #pragma omp for for (int i=1;i<= num_steps; i++){ double x = (i-0.5)*step; sumP += 4.0/(1.0+x*x); } #pragma omp atomic sum += sumP; } double pi = step * sum; runTime = omp_get_wtime() - start; #pragma omp atomic checkParallel++; #pragma omp single { printf("step = %d, pi = %.10lf, %f s",num_steps,pi,runTime); if(checkParallel == 1) printf("(serial + overhead)"); else printf("(parallel)"); if(red) printf("(with red)\n"); else printf("(non-red)\n"); checkParallel = 0; }
} void pi(long num_steps){ double start, runTime, step = 1.0/(double) num_steps; start = omp_get_wtime(); sum = 0.0; for (int i=1;i<= num_steps; i++){ double x = (i-0.5)*step; sum += 4.0/(1.0+x*x); } double pi = step * sum; runTime = omp_get_wtime() - start; printf("step = %d, pi = %.10lf, %f detik(serial)\n",num_steps,pi,runTime); } int main () { long steps = 500000000; for(int i = 0; i < 1; i++){ #pragma omp parallel num_threads(1) piP(steps, 1); pi(steps); #pragma omp parallel piP(steps,1); printf("\n"); } }
b. Output
2. PROGRAM PERKALIAN MATRIKS a. source code #include<stdio.h> #include<stdlib.h> #include #include void MMulT(int n); void MMul(int n); int main(){ int nList[] = {500,1000,2000,4000}; for(int i = 0; i < 4; i++){ MMul(nList[i]); } for(int i = 0; i < 4; i++){ MMulT(nList[i]); } } void MMul(int n){ clock_t start, finish; start = clock(); int checkParallel = 0; double *arrayA = malloc(sizeof(double) * n * n); double *arrayB = malloc(sizeof(double) * n * n); double *result = malloc(sizeof(double) * n * n); double *arrayTemp = malloc(sizeof(double) * n * n); #pragma omp parallel { #pragma omp for for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ int sum = 0; for(int k = 0; k < n; k++){ sum += arrayA[(n*i)+k] * arrayB[(n*k)+j]; } result[(n*i)+j] = sum; } } #pragma omp atomic checkParallel++; } finish = clock(); printf("processing time B not transposed, n = %d", n); if(checkParallel == 1)
printf("(serial) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); else printf("(parallel) : %.7lf\n", ((double)(finishstart) / CLOCKS_PER_SEC)); } void MMulT(int n){ clock_t start, finish; start = clock(); int checkParallel = 0; double *arrayA = malloc(sizeof(double) * n * n); double *arrayB = malloc(sizeof(double) * n * n); double *result = malloc(sizeof(double) * n * n); double *arrayTemp = malloc(sizeof(double) * n * n); #pragma omp parallel { //transpose matrix B #pragma omp for for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ arrayTemp[(n*i)+j] = arrayB[(n*j)+i]; } } #pragma omp single { free(arrayB); arrayB = arrayTemp; } #pragma omp for for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ int sum = 0; for(int k = 0; k < n; k++){ sum += arrayA[(n*i)+k] * arrayB[(n*j)+k]; } result[(n*i)+j] = sum; } } #pragma omp atomic checkParallel++; } finish = clock(); printf("processing time B transposed, n = %d", n); if(checkParallel == 1) printf("(serial) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); else printf("(parallel) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); }
b.
output
3. PROGRAM FIBONACCI a. Source code #include <stdio.h> #include <stdlib.h> #include #include int fib(int n); int main(){ clock_t s, f; int n=40; long a; s=clock(); #pragma omp parallel num_threads(4) { #pragma omp single a=fib(n); } f=clock(); printf("nilai fibonacci %ld \n", a); printf("waktu eksekusi : %.7lf\n", ((double)(fs)/CLOCKS_PER_SEC)); } int fib(int n){ long x, y; if(n<2){ return n; } else{ #pragma omp task shared(x) x=fib(n-1); #pragma omp task shared(y) y=fib(n-2); #pragma omp taskwait return x+y; } }
b. Output
OLEH:
Muthalia Annisa (D42116307)
DEPARTEMEN TEKNIK INFORMATIKA FAKULTAS TEKNIK UNIVERSITAS HASANUDDIN 2019
1. PROGRAM PHI a. Source code #include <stdio.h> #include
} void pi(long num_steps){ double start, runTime, step = 1.0/(double) num_steps; start = omp_get_wtime(); sum = 0.0; for (int i=1;i<= num_steps; i++){ double x = (i-0.5)*step; sum += 4.0/(1.0+x*x); } double pi = step * sum; runTime = omp_get_wtime() - start; printf("step = %d, pi = %.10lf, %f detik(serial)\n",num_steps,pi,runTime); } int main () { long steps = 500000000; for(int i = 0; i < 1; i++){ #pragma omp parallel num_threads(1) piP(steps, 1); pi(steps); #pragma omp parallel piP(steps,1); printf("\n"); } }
b. Output
2. PROGRAM PERKALIAN MATRIKS a. source code #include<stdio.h> #include<stdlib.h> #include
printf("(serial) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); else printf("(parallel) : %.7lf\n", ((double)(finishstart) / CLOCKS_PER_SEC)); } void MMulT(int n){ clock_t start, finish; start = clock(); int checkParallel = 0; double *arrayA = malloc(sizeof(double) * n * n); double *arrayB = malloc(sizeof(double) * n * n); double *result = malloc(sizeof(double) * n * n); double *arrayTemp = malloc(sizeof(double) * n * n); #pragma omp parallel { //transpose matrix B #pragma omp for for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ arrayTemp[(n*i)+j] = arrayB[(n*j)+i]; } } #pragma omp single { free(arrayB); arrayB = arrayTemp; } #pragma omp for for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ int sum = 0; for(int k = 0; k < n; k++){ sum += arrayA[(n*i)+k] * arrayB[(n*j)+k]; } result[(n*i)+j] = sum; } } #pragma omp atomic checkParallel++; } finish = clock(); printf("processing time B transposed, n = %d", n); if(checkParallel == 1) printf("(serial) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); else printf("(parallel) : %.7lf\n", ((double)(finish-start) / CLOCKS_PER_SEC)); }
b.
output
3. PROGRAM FIBONACCI a. Source code #include <stdio.h> #include <stdlib.h> #include
b. Output
More Documents from "Sulthan Abdullah"
Paralel.docx
April 2020 22
331642_kelompok 1_tutorial Unity.docx
April 2020 23
Rancang Sistem Multiple Warning Deteksi Asap Rokok.docx
April 2020 18
Tugas Parallel.docx
June 2020 17
Muthalia Annisa _ D42116307.docx
April 2020 6