使用C++编写的并行实现矩阵的乘法运算

// Cannon.cpp : 定义控制台应用程序的入口点。
#include "StdAfx.h"
#include "omp.h"
#include "conio.h"
#include "stdio.h"
#include "stdlib.h"
#include "math.h"

#define N 160

void MoveDataBlockLine_A( int A[][N], int lineNumber )
{
int i,j, k, jump=N/4;
int tmp[N/4][N/4];

for( i=0; ifor( j=0; jtmp[i][j] = A[i+jump*lineNumber][j];

for( k=0; k<3; k++ )
{
for( i=0; ifor( j=0; jA[i+jump*lineNumber][j+jump*k] = A[i+jump*lineNumber][j+jump*(k+1)];
}

for( i=0; ifor( j=0; jA[i+jump*lineNumber][j+jump*3] = tmp[i][j];
}

void MoveDataBlockLine_B( int B[][N], int lineNumber )
{
int i,j, k, jump=N/4;
int tmp[N/4][N/4];

for( i=0; ifor( j=0; jtmp[i][j] = B[i][j+jump*lineNumber];

for( k=0; k<3; k++ )
{
for( i=0; ifor( j=0; jB[i+jump*k][j+jump*lineNumber] = B[i+jump*(k+1)][j+jump*lineNumber];
}

for( i=0; ifor( j=0; jB[i+jump*3][j+jump*lineNumber] = tmp[i][j];
}

void MutiplyBlock( int A[][N], int B[][N], int C[][N], int bi, int bj )
{
int i,j,jump=N/4;
for( i=0; ifor( j=0; jC[i+jump*bi][j+jump*bj] += A[i+jump*bi][j+jump*bj] * B[i+jump*bi][j+jump*bj];
}

int main()
{
FILE *fpA, *fpB, *fpC;
int i, j, k, jump=N/4;
int A[N][N], B[N][N], C[N][N];

printf( "\n开始 计算 ..." );
fpA = fopen( "A.txt", "w+" );
fpB = fopen( "B.txt", "w+" );
for( i=0; ifor( j=0; j{
A[i][j] = rand()%100; fprintf( fpA, "\n A[%d][%d] = %d ", i, j, A[i][j] );
B[i][j] = rand()%100; fprintf( fpB, "\n B[%d][%d] = %d ", i, j, B[i][j] );
C[i][j] = 0;
}
fclose(fpA);
fclose(fpB);

// 设置线程
omp_set_num_threads( 2 );

if( N % 4 == 0 )
{
#pragma omp parallel shared( A, B, C ) private( i,j )
{
#pragma omp sections
{
#pragma omp section
{
printf("\n Sections 1, thread number %d ", omp_get_thread_num() );
MoveDataBlockLine_A( A, 1 );
MoveDataBlockLine_A( A, 2 );
MoveDataBlockLine_A( A, 2 );
MoveDataBlockLine_A( A, 3 );
MoveDataBlockLine_A( A, 3 );
MoveDataBlockLine_A( A, 3 );
}

#pragma omp section
{
printf("\n Sections 1, thread number %d ", omp_get_thread_num() );
MoveDataBlockLine_B( B, 1 );
MoveDataBlockLine_B( B, 2 );
MoveDataBlockLine_B( B, 2 );
MoveDataBlockLine_B( B, 3 );
MoveDataBlockLine_B( B, 3 );
MoveDataBlockLine_B( B, 3 );
}
}
}
//开始计算
for( k=0; k<4; k++ )
{
#pragma omp parallel shared( A, B, C ) private( i,j )
{
#pragma omp sections
{
#pragma omp section
{
printf("\n Setctons 2, thread number %d ", omp_get_thread_num() );
for( i=0; i<2; i++ )
for( j=0; j<4; j++ )
MutiplyBlock( A, B,

C, i, j );

MoveDataBlockLine_A( A, 0 );
MoveDataBlockLine_B( B, 0 );
MoveDataBlockLine_A( A, 1 );
MoveDataBlockLine_B( B, 1 );
}

#pragma omp section
{
printf("\n Setctons 2, thread number %d ", omp_get_thread_num() );
for( i=2; i<4; i++ )
for( j=0; j<4; j++ )
MutiplyBlock( A, B, C, i, j );

MoveDataBlockLine_A( A, 2 );
MoveDataBlockLine_B( B, 2 );
MoveDataBlockLine_A( A, 3 );
MoveDataBlockLine_B( B, 3 );
}
}
}
}

// 显示本次结果
fpC = fopen( "C.txt", "w+" );
for( i=0; ifor( j=0; j{
//printf( "\n C[%d][%d] = %d ", i, j, C[i][j] );
fprintf( fpC, "\n C[%d][%d] = %d ", i, j, C[i][j] );
}
fclose(fpC);
}
else
printf("\n Error! N % 4 != 0 ! ");

printf( "\nCannon 计算结束 ...\n" );
getchar();
}