大矩阵相乘-openMP

源代码

#include

#include "omp.h"

#include

#include

#include

#define N 2000

int A[N][N],B[N][N];

int result_p[N][N];//parallel

int result_s[N][N];//serial

//矩阵产生函数，通过改变rand函数模值改变矩阵的稠密

void generate_matrix(int n)

{

int i,j;

memset(result_p,0,sizeof(result_p));

memset(result_s,0,sizeof(result_s));

srand((unsigned int)time(NULL));

for(i=0;i

{

for(j=0;j

{

A[i][j] = rand() 0;//稀疏

B[i][j] = rand() 0;

}

}

}

//串行处理程序

void serial_bigmmult(int n)

{

int i,j,k;

int time;

struct timespec time1 = {0, 0};

    struct timespec time2 = {0, 0};

clock_gettime(CLOCK_REALTIME, &time1);

printf("sec num: %d nsec num:   %d\n",time1.tv_sec,time1.tv_nsec);

//clock_t startTime , endTime;

//startTime = clock();

for (i=0;i

{

for(j=0;j

{

result_s[i][j]=0;

for(k=0;k

{

result_s[i][j]+=A[i][k]*B[k][j];

}

}

}

clock_gettime(CLOCK_REALTIME, &time2);

    printf("sec num: %d nsec num: %d\n",time2.tv_sec,time2.tv_nsec);

    printf("serial time: %d ms\n",(time2.tv_sec-time1.tv_sec)*1000+(time2.tv_nsec-time1.tv_nsec)/1000000);

///endTime = clock();

//time = endTime - startTime;

//printf("serial use time = %d ms\n",time);

}

//结果正确性对比函数

int is_result_correct(int n)

{

int i,j;

for(i=0;i

{

for(j=0;j

{

if(result_p[i][j] != result_s[i][j])return 0;

}

}

return 1;

}

//openMP并行程序

void omp_bigmmult(int n,int thread)

{

int i,j,k;

int time;

//clock_t startTime , endTime;

omp_set_num_threads(thread);

struct timespec time1 = {0, 0};

    struct timespec time2 = {0, 0};

clock_gettime(CLOCK_REALTIME, &time1);

printf("sec num: %d nsec num:   %d\n",time1.tv_sec,time1.tv_nsec);

//startTime = clock();

//创建并行区域

#pragma omp parallel shared(A,B,result_p) private(i,j,k) 

{

#pragma omp for schedule(dynamic)

for (i=0;i

{

for(j=0;j

{

result_p[i][j]=0;

for(k=0;k

{

result_p[i][j]+=A[i][k]*B[k][j];

}

}

}

}

printf("%d\n",omp_get_num_procs());

clock_gettime(CLOCK_REALTIME, &time2);

    printf("sec num: %d nsec num: %d\n",time2.tv_sec,time2.tv_nsec);

    printf("parallel time: %d ms\n",(time2.tv_sec-time1.tv_sec)*1000+(time2.tv_nsec-time1.tv_nsec)/1000000);

//endTime = clock();

//time = endTime - startTime;

//printf("parallel use time = %d ms\n",time);

}

int main(int argc, char* argv[])

{

int n, thread;

if(scanf("%d%d",&n,&thread)!=EOF)

{

generate_matrix(n);

omp_bigmmult(n,thread);

serial_bigmmult(n);

if(is_result_correct(n))printf("result correct\n");

else printf("wrong answer\n");

}

return 0;

}

编译命令

gcc -fopenmp -c omp_matrix_multiply.c 

gcc -fopenmp omp_matrix_multiply.o -o bts