矩阵相乘的并行算法的设计与实现.doc

仲恺农业工程学院实验报告纸计算机科学与工程学院（院、系） 网络工程 专业 083 班 组 并行计算应用试验 课学号：200810224311 姓名：李志冬 实验日期：2011-05-19 教师评定 实验三 矩阵相乘的并行算法的设计与实现一、 实验目的 理解和掌握矩阵相乘的并行算法的设计思想以及实现原理二、 实验内容 编译和运行一个两矩阵相乘算法的并行程序三、 实验步骤1 使用vi编辑器输入并行计算的代码，保存在multi.c中#include #include mpi.h#define NRA 62#define NCA 15#define NCB 7#define MASTER 0#define FROM_MASTER 1#define FROM_WORKER 2MPI_Status status;int main(int argc, char *argv)int numtasks,taskid,numworkers,source,dest,nbytes,mtype,intsize,dbsize,rows,averow,extra,offset,i,j,k,count;double aNRANCA,bNCANCB,cNRANCB;intsize = sizeof(int);dbsize = sizeof(double);MPI_Init(&argc,&argv);MPI_Comm_rank(MPI_COMM_WORLD,&taskid);MPI_Comm_size(MPI_COMM_WORLD,&numtasks);numworkers = numtasks-1;if(taskid=MASTER) printf(Number of worker tasks = %dn,numworkers);for(i=0;iNRA;i+)for(j=0;jNCA;j+)aij=i+j;for(i=0;iNCA;i+)for(j=0;jNCB;j+)bij=i*j;averow=NRA/numworkers;extra=NRA%numworkers;offset=0;mtype=FROM_MASTER;for(dest=1;dest=numworkers;dest+) rows=(dest=extra)?averow+1:averow;printf(sending %d rows to task %dn,rows,dest);MPI_Send(&offset,1,MPI_INT,dest,mtype,MPI_COMM_WORLD);MPI_Send(&rows,1,MPI_INT,dest,mtype,MPI_COMM_WORLD);count=rows*NCA;MPI_Send(&aoffset0,count,MPI_DOUBLE,dest,mtype,MPI_COMM_WORLD);count=NCA*NCB;MPI_Send(&b,count,MPI_DOUBLE,dest,mtype,MPI_COMM_WORLD);offset=offset+rows;mtype=FROM_WORKER;for(i=1;i=numworkers;i+) source = i;MPI_Recv(&offset,1,MPI_INT,source,mtype,MPI_COMM_WORLD,&status);MPI_Recv(&rows,1,MPI_INT,source,mtype,MPI_COMM_WORLD,&status);count=rows*NCB;MPI_Recv(&coffset0,count,MPI_DOUBLE,source,mtype,MPI_COMM_WORLD,&status);printf(Here is the result matrixn);for(i=0;iNRA;i+) printf(n);for(j=0;jMASTER) mtype=FROM_MASTER;source=MASTER;printf(Master=%d,mtype=%dn,source,mtype);MPI_Recv(&offset,1,MPI_INT,source,mtype,MPI_COMM_WORLD,&status);printf(offset=%dn,offset);MPI_Recv(&rows,1,MPI_INT,source,mtype,MPI_COMM_WORLD,&status);printf(rows=%dn,rows);count=rows*NCA;MPI_Recv(&a,count,MPI_DOUBLE,source,mtype,MPI_COMM_WORLD,&status);printf(a00=%en,a00);count=NCA*NCB;MPI_Recv(&b,count,MPI_DOUBLE,source,mtype,MPI_COMM_WORLD,&status);printf(b=n);for(k=0;kNCB;k+)for(i=0;irows;i+) cik=0.0;for(j=0;jNCA;j+)cik=cik+aij*bjk;mtype=FROM_WORKER;printf(after computern);MPI_Send(&offset,1,MPI_INT,MASTER,mtype,MPI_COMM_WORLD);MPI_Send(&rows,1,MPI_INT,MASTER,mtype,MPI_COMM_WORLD);MPI_Send(&c,rows*NCB,MPI_DOUBLE,MASTER,mtype,MPI_COMM_WORLD);printf(after sendn);MPI_Finalize();return 0;2 编译multi.cmpicc o multi.o multi.c3 启动mpd后台程序mpd&4 在单机上运行multi.ompirun np 10 ./multi.o5 在多台计算机上运行multi.o(1) 编辑并行计算的主机文件nodelistnode1:5node2:4node3:8(2) 运行并行计算程序mpirun -machinefile nodelist -np 2 ./multi.o四、 实验结果单机运行结果：Master=0,mtype=1Master=0,mtype=1Number of worker tasks = 9sending 7 rows to task 1sending 7 rows to task 2sending 7 rows to task 3sending 7 rows to task 4sending 7 rows to task 5sending 7 rows to task 6sending 7 rows to task 7sending 7 rows to task 8sending 6 rows to task 9Master=0,mtype=1offset=0rows=7a00=0.000000e+00b=after computerafter sendMaster=0,mtype=1offset=7rows=7a00=7.000000e+00b=after computerafter sendMaster=0,mtype=1offset=14rows=7a00=1.400000e+01b=after computerafter sendMaster=0,mtype=1offset=28rows=7a00=2.800000e+01b=after computerafter sendMaster=0,mtype=1offset=56rows=6a00=5.600000e+01b=after computerafter sendMaster=0,mtype=1offset=21rows=7a00=2.100000e+01b=after computerafter sendMaster=0,mtype=1offset=49rows=7a00=4.900000e+01b=after computerafter sendoffset=35rows=7a00=3.500000e+01b=after computerafter sendoffset=42rows=7a00=4.200000e+01b=after computerafter sendHere is the result matrix双机运行的结果：Number of worker tasks = 1sending 62 rows to task 1Master=0,mtype=1offset=0rows=62a00=0.0