-
Notifications
You must be signed in to change notification settings - Fork 10
/
cannon.c
100 lines (99 loc) · 2.72 KB
/
cannon.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include<stdio.h>
#include<stdlib.h>
#include<mpi.h>
int main(int argc,char *argv[])
{
int rank,size,row=0,column=0,count=0,i=0,j=0,k=0;
char ch;
float *A,*B,*C,a=0,b=0,c=0,n;
FILE *fp;
MPI_Init(NULL,NULL);
MPI_Comm_size(MPI_COMM_WORLD,&size);
MPI_Comm_rank(MPI_COMM_WORLD,&rank);
if(rank==0)
{
fp=fopen("A.txt","r");
while(fscanf(fp,"%f",&n)!=-1)
{
ch=fgetc(fp);
if(ch=='\n'){ row=row+1; }
count++;
}
column=count/row;
if(count!=size) { printf("No of Proc must be equal to %d\nCode terminated",count); exit(0); }
fseek( fp, 0, SEEK_SET );
A=(float*)calloc(sizeof(float),row*column);
B=(float*)calloc(sizeof(float),row*column);
k=0;
printf("A matrix:\n");
for(i=0;i<row;i++)
{
for(j=0;j<column;j++)
{
fscanf(fp,"%f",&n);
A[k]=n;
printf("%f\t",A[k]);
k++;
}
printf("\n");
}
fclose(fp);
k=0;
printf("\nB matrix:\n");
fp=fopen("B.txt","r");
for(i=0;i<row;i++)
{
for(j=0;j<column;j++)
{
fscanf(fp,"%f",&n);
B[k]=n;
printf("%f\t",B[k]);
k++;
}
printf("\n");
}
fclose(fp);
}
MPI_Bcast(&row,1,MPI_INT,0,MPI_COMM_WORLD);
int periods[]={1,1}; //both vertical and horizontal movement;
int dims[]={row,row};
int coords[2]; /* 2 Dimension topology so 2 coordinates */
int right=0, left=0, down=0, up=0; // neighbor ranks
MPI_Comm cart_comm;
MPI_Cart_create(MPI_COMM_WORLD,2,dims,periods,1,&cart_comm );
MPI_Scatter(A,1,MPI_FLOAT,&a,1,MPI_FLOAT,0,cart_comm);
MPI_Scatter(B,1,MPI_FLOAT,&b,1,MPI_FLOAT,0,cart_comm);
MPI_Comm_rank(cart_comm,&rank);
MPI_Cart_coords(cart_comm,rank,2,coords);
MPI_Cart_shift(cart_comm, 1, coords[0], &left,&right);
MPI_Cart_shift(cart_comm, 0, coords[1], &up,&down);
MPI_Sendrecv_replace(&a,1,MPI_FLOAT,left,11,right,11,cart_comm,MPI_STATUS_IGNORE);
MPI_Sendrecv_replace(&b,1,MPI_FLOAT,up,11,down,11,cart_comm,MPI_STATUS_IGNORE);
c = c + a*b;
for(i=1;i<row;i++)
{
MPI_Cart_shift(cart_comm, 1, 1, &left,&right);
MPI_Cart_shift(cart_comm, 0, 1, &up,&down);
MPI_Sendrecv_replace(&a,1,MPI_FLOAT,left,11,right,11,cart_comm,MPI_STATUS_IGNORE);
MPI_Sendrecv_replace(&b,1,MPI_FLOAT,up,11,down,11,cart_comm,MPI_STATUS_IGNORE);
c = c + a*b;
}
C=(float*)calloc(sizeof(float),row*row);
MPI_Gather(&c,1,MPI_FLOAT,C,1,MPI_FLOAT,0,cart_comm);
if(rank==0)
{
k=0;
printf("\nA * B:\n");
for(i=0;i<row;i++)
{
for(j=0;j<row;j++)
{
printf("%f\t",C[k]);
k++;
}
printf("\n");
}
}
MPI_Finalize();
return 0;
}