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
|
/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.6 -------------------------------------------------*/
/* date: 6/15/2017 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc --------------------------*/
/****************************************************************/
/*
Copyright (c) 2010-2017, The Regents of the University of California
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include <mpi.h>
#include <sys/time.h>
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <sstream>
#include "CombBLAS/CombBLAS.h"
#include "CombBLAS/CommGrid3D.h"
#include "CombBLAS/SpParMat3D.h"
#include "CombBLAS/ParFriends.h"
using namespace std;
using namespace combblas;
#define EPS 0.0001
#ifdef _OPENMP
int cblas_splits = omp_get_max_threads();
#else
int cblas_splits = 1;
#endif
// Simple helper class for declarations: Just the numerical type is templated
// The index type and the sequential matrix type stays the same for the whole code
// In this case, they are "int" and "SpDCCols"
template <class NT>
class PSpMat
{
public:
typedef SpDCCols < int64_t, NT > DCCols;
typedef SpParMat < int64_t, NT, DCCols > MPI_DCCols;
};
int main(int argc, char* argv[])
{
int nprocs, myrank;
MPI_Init(&argc, &argv);
MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
if(argc < 2){
if(myrank == 0)
{
cout << "Usage: ./<Binary> <MatrixA> " << endl;
}
MPI_Finalize();
return -1;
}
else {
double vm_usage, resident_set;
string Aname(argv[1]);
if(myrank == 0){
fprintf(stderr, "Data: %s\n", argv[1]);
}
shared_ptr<CommGrid> fullWorld;
fullWorld.reset( new CommGrid(MPI_COMM_WORLD, 0, 0) );
double t0, t1;
SpParMat<int64_t, double, SpDCCols < int64_t, double >> M(fullWorld);
//// Read matrix market files
//t0 = MPI_Wtime();
//M.ParallelReadMM(Aname, true, maximum<double>());
//t1 = MPI_Wtime();
//if(myrank == 0) fprintf(stderr, "Time taken to read file: %lf\n", t1-t0);
//t0 = MPI_Wtime();
//FullyDistVec<int64_t, int64_t> p( M.getcommgrid() );
//FullyDistVec<int64_t, int64_t> q( M.getcommgrid() );
//p.iota(M.getnrow(), 0);
//q.iota(M.getncol(), 0);
//p.RandPerm();
//q.RandPerm();
//(M)(p,q,true);// in-place permute to save memory
//t1 = MPI_Wtime();
//if(myrank == 0) fprintf(stderr, "Time taken to permuatate input: %lf\n", t1-t0);
// Read labelled triple files
t0 = MPI_Wtime();
M.ReadGeneralizedTuples(Aname, maximum<double>());
t1 = MPI_Wtime();
if(myrank == 0) fprintf(stderr, "Time taken to read file: %lf\n", t1-t0);
typedef PlusTimesSRing<double, double> PTFF;
// Run 2D multiplication to compare against
SpParMat<int64_t, double, SpDCCols < int64_t, double >> A2D(M);
SpParMat<int64_t, double, SpDCCols < int64_t, double >> B2D(M);
SpParMat<int64_t, double, SpDCCols < int64_t, double >> C2D =
Mult_AnXBn_Synch<PTFF, double, SpDCCols<int64_t, double>, int64_t, double, double, SpDCCols<int64_t, double>, SpDCCols<int64_t, double> >
(A2D, B2D);
if(myrank == 0) fprintf(stderr, "2D Multiplication done \n");
// Increase number of layers 1 -> 4 -> 16
for(int layers = 1; layers <= 16; layers = layers * 4){
// Create two copies of input matrix which would be used in multiplication
SpParMat<int64_t, double, SpDCCols < int64_t, double >> A2(M);
SpParMat<int64_t, double, SpDCCols < int64_t, double >> B2(M);
// Convert 2D matrices to 3D
SpParMat3D<int64_t, double, SpDCCols < int64_t, double >> A3D(A2, layers, true, false);
SpParMat3D<int64_t, double, SpDCCols < int64_t, double >> B3D(B2, layers, false, false);
if(myrank == 0) fprintf(stderr, "Running 3D with %d layers\n", layers);
SpParMat3D<int64_t, double, SpDCCols < int64_t, double >> C3D =
Mult_AnXBn_SUMMA3D<PTFF, double, SpDCCols<int64_t, double>, int64_t, double, double, SpDCCols<int64_t, double>, SpDCCols<int64_t, double> >
(A3D, B3D);
SpParMat<int64_t, double, SpDCCols < int64_t, double >> C3D2D = C3D.Convert2D();
if(C2D == C3D2D){
if(myrank == 0) fprintf(stderr, "Correct!\n");
}
else{
if(myrank == 0) fprintf(stderr, "Not correct!\n");
}
}
}
MPI_Finalize();
return 0;
}
|
