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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
#include <iostream>
#include <fstream>
#include <mpi.h>
#include <sys/time.h>
#include "../SpTuples.h"
#include "../SpDCCols.h"
#include "../SpParMat.h"
using namespace std;
using namespace combblas;
int main()
{
MPI_Init(NULL,NULL);
int nprocs, myrank;
MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
typedef PlusTimesSRing<double, double> PT;
if (myrank == 0)
{
ifstream inputa("matrixA.txt");
ifstream inputb("matrixB.txt");
if(!(inputa.is_open() && inputb.is_open()))
{
cerr << "One of the input files doesn't exist\n";
exit(-1);
}
SpDCCols<int,double> A;
inputa >> A;
A.PrintInfo();
SpDCCols<int,double> B;
inputb >> B;
B.PrintInfo();
// arguments (in this order): nnz, n, m, nzc
SpDCCols<int,double> C(0, A.getnrow(), B.getncol(), 0);
C.PrintInfo();
C.SpGEMM <PT> (A, B, false, false); // C = A*B
C.PrintInfo();
SpDCCols<int,bool> A_bool = A;
A_bool.PrintInfo();
SpTuples<int,double> * C_tuples = MultiplyReturnTuples<PT>(A_bool, B, false, false); // D = A_bool*B
C_tuples->PrintInfo();
SpTuples<int,double> * C_tt = MultiplyReturnTuples<PT>(B, A_bool, false, true);
C_tt->PrintInfo();
vector< SpTuples<int,double> *> tomerge;
tomerge.push_back(C_tuples);
tomerge.push_back(C_tt);
SpTuples<int,double> twice = MergeAll<PT>(tomerge);
twice.PrintInfo();
delete C_tuples;
delete C_tt;
}
#define BIGTEST
//#define MASSIVETEST
//#define OUTPUT
// Start big timing test
vector<string> prefixes;
#ifdef BIGTEST
prefixes.push_back("largeseq");
#endif
#ifdef MASSIVETEST
prefixes.push_back("massiveseq");
#endif
for(int i=0; i< prefixes.size(); i++)
{
ifstream input1, input2;
if(myrank == 0)
{
string inputname1 = prefixes[i] + string("/input1_0");
string inputname2 = prefixes[i] + string("/input2_0");
input1.open(inputname1.c_str());
input2.open(inputname2.c_str());
if(!(input1.is_open() && input2.is_open()))
{
cerr << "One of the input files doesn't exist\n";
exit(-1);
}
SpDCCols<int,double> bigA;
input1 >> bigA;
bigA.PrintInfo();
SpDCCols<int,double> bigA1, bigA2;
bigA.Split(bigA1, bigA2);
bigA1.PrintInfo();
bigA2.PrintInfo();
bigA.Merge(bigA1, bigA2);
bigA.PrintInfo();
SpDCCols<int,double> bigB;
input2 >> bigB;
bigB.PrintInfo();
// Cache warm-up
SpTuples<int,double> * bigC = MultiplyReturnTuples<PT>(bigA, bigB, false, false);
bigC->PrintInfo();
#ifdef OUTPUT
string outputnameC = prefixes[i] + string("/colbycol");
ofstream outputC(outputnameC.c_str());
outputC << (*bigC);
outputC.close();
#endif
struct timeval tempo1, tempo2;
double elapsed_time; /* elapsed time in seconds */
long elapsed_seconds; /* diff between seconds counter */
long elapsed_useconds; /* diff between microseconds counter */
gettimeofday(&tempo1, NULL);
bigC = MultiplyReturnTuples<PT>(bigA, bigB, false, false);
gettimeofday(&tempo2, NULL);
elapsed_seconds = tempo2.tv_sec - tempo1.tv_sec;
elapsed_useconds = tempo2.tv_usec - tempo1.tv_usec;
elapsed_time = (elapsed_seconds + ((double) elapsed_useconds)/1000000.0);
printf("ColByCol time = %.5f seconds\n", elapsed_time);
bigB.Transpose(); // now that bigB is transposed, bigC_t will be equal to bigC
bigB.PrintInfo();
// Cache warm-up
SpTuples<int,double> * bigC_t = MultiplyReturnTuples<PT>(bigA, bigB, false, true);
bigC_t->PrintInfo();
#ifdef OUTPUT
string outputnameCT = prefixes[i] + string("/outerproduct");
ofstream outputCT(outputnameCT.c_str());
outputCT << (*bigC_t);
outputCT.close();
#endif
gettimeofday(&tempo1, NULL);
bigC_t = MultiplyReturnTuples<PT>(bigA, bigB, false, true);
gettimeofday(&tempo2, NULL);
elapsed_seconds = tempo2.tv_sec - tempo1.tv_sec;
elapsed_useconds = tempo2.tv_usec - tempo1.tv_usec;
elapsed_time = (elapsed_seconds + ((double) elapsed_useconds)/1000000.0);
printf("OuterProduct time = %.5f seconds\n", elapsed_time);
input1.seekg (0, ios::beg);
input2.seekg (0, ios::beg);
vector< SpTuples<int,double> *> tomerge;
tomerge.push_back(bigC);
tomerge.push_back(bigC_t);
SpTuples<int,double> twice = MergeAll<PT>(tomerge);
twice.PrintInfo();
delete bigC;
delete bigC_t;
#ifdef OUTPUT
string outputnametwice = prefixes[i] + string("/twice");
ofstream outputtw(outputnametwice.c_str());
outputtw << twice;
outputtw.close();
#endif
cerr << "Begin Parallel" << endl;
}
// ABAB: Make a macro such as "PARTYPE(it,nt,seqtype)" that just typedefs this guy !
typedef SpParMat <int, double, SpDCCols<int,double> > PARSPMAT;
PARSPMAT A_par;
PARSPMAT B_par;
cerr << "A and B constructed"<< endl;
A_par.ReadDistribute(input1, 0);
// collective calls
int parnnzA = A_par.getnnz();
int parmA = A_par.getnrow();
int parnA = A_par.getncol();
if(myrank == 0)
cout << "A_par has " << parnnzA << " nonzeros and " << parmA << "-by-" << parnA << " dimensions" << endl;
B_par.ReadDistribute(input2, 0);
int parnnzB = B_par.getnnz();
int parmB = B_par.getnrow();
int parnB = B_par.getncol();
if(myrank == 0)
cout << "B_par has " << parnnzB << " nonzeros and " << parmB << "-by-" << parnB << " dimensions" << endl;
PARSPMAT C_par = Mult_AnXBn_Synch<PT> (A_par, B_par);
// collective calls
int parnnzC = C_par.getnnz();
int parmC = C_par.getnrow();
int parnC = C_par.getncol();
if(myrank == 0)
{
cout << "C_par has " << parnnzC << " nonzeros and " << parmC << "-by-" << parnC << " dimensions" << endl;
input1.close();
input2.close();
}
}
MPI_Finalize();
}
|
