Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
18BCE2182 ASSESS_1 Q2-1
#include <stdio.h> #include <stdlib.h> #include <omp.h> #define M 5 #define N 5 int main(int argc, char *argv) { int i,j; double t; double start, end, start_p, end_p; double **A; A= malloc(M*sizeof(double *)); for(i=0; i<M; i++) { A[i]= malloc(N*sizeof(double)); } for(i=0; i<M; i++) { for(j=0; j<N; j++) { A[i][j]=rand(); } } start= omp_get_wtime(); for(i=0; i<M; i++) { for(j=0; j<N; j++) { t=A[i][j]; A[i][j]=A[j][i]; A[j][i]=t; } } end= omp_get_wtime(); printf("Serial Execution Time: %f\n\n",(end-start)); ////////////////////////////////// start_p= omp_get_wtime(); #pragma omp parallel for for(i=0; i<M; i++) { for(j=0; j<N; j++) { t=A[i][j]; A[i][j]=A[j][i]; A[j][i]=t; } } end_p= omp_get_wtime(); printf("Parallel Execution Time: %f\n\n",(end_p-start_p)); return 0; }
run
|
edit
|
history
|
help
0
PROTOTIPO PREGUNTA 1 DE GUÍA 4
función malloc()
140114_CribaErasthotenes
GCC supports 128-bit integer arithmetic
strcat
Lab 9 v0.8
a
14th Dec Project1 v0.4
FUNTION 2
address extraction