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
216
217
218
219
220
221
|
/****************************************************************/
/* 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>
// These macros should be defined before stdint.h is included
#ifndef __STDC_CONSTANT_MACROS
#define __STDC_CONSTANT_MACROS
#endif
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS
#endif
#include <stdint.h>
#include <sys/time.h>
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <ctime>
#include <cmath>
#include "CombBLAS/CombBLAS.h"
#include "CC.h"
using namespace std;
using namespace combblas;
/**
** Connected components based on Awerbuch-Shiloach algorithm
**/
class Dist
{
public:
typedef SpDCCols < int64_t, double > DCCols;
typedef SpParMat < int64_t, double, DCCols > MPI_DCCols;
};
int main(int argc, char* argv[])
{
int provided;
MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &provided);
if (provided < MPI_THREAD_SERIALIZED)
{
printf("ERROR: The MPI library does not have MPI_THREAD_SERIALIZED support\n");
MPI_Abort(MPI_COMM_WORLD, 1);
}
int nthreads = 1;
#ifdef THREADED
#pragma omp parallel
{
nthreads = omp_get_num_threads();
}
#endif
int nprocs, myrank;
MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
if(myrank == 0)
{
cout << "Process Grid (p x p x t): " << sqrt(nprocs) << " x " << sqrt(nprocs) << " x " << nthreads << endl;
}
if(argc < 3)
{
if(myrank == 0)
{
cout << "Usage: ./cc -I <mm|triples> -M <FILENAME_MATRIX_MARKET> (required)\n";
cout << "-I <INPUT FILE TYPE> (mm: matrix market, triples: (vtx1, vtx2, edge_weight) triples. default:mm)\n";
cout << "-base <BASE OF MATRIX MARKET> (default:1)\n";
cout << "-rand <RANDOMLY PERMUTE VERTICES> (default:0)\n";
cout << "Example (0-indexed mtx with random permutation): ./cc -M input.mtx -base 0 -rand 1" << endl;
cout << "Example (triples format): ./cc -I triples -M input.txt" << endl;
}
MPI_Finalize();
return -1;
}
{
string ifilename = "";
int base = 1;
int randpermute = 1;
bool isMatrixMarket = true;
for (int i = 1; i < argc; i++)
{
if (strcmp(argv[i],"-I")==0)
{
string ifiletype = string(argv[i+1]);
if(ifiletype == "triples") isMatrixMarket = false;
}
if (strcmp(argv[i],"-M")==0)
{
ifilename = string(argv[i+1]);
if(myrank == 0) printf("filename: %s\n",ifilename.c_str());
}
else if (strcmp(argv[i],"-base")==0)
{
base = atoi(argv[i + 1]);
if(myrank == 0) printf("\nBase of MM (1 or 0):%d",base);
}
else if (strcmp(argv[i],"-rand")==0)
{
randpermute = atoi(argv[i + 1]);
if(myrank == 0) printf("\nRandomly permute the matrix? (1 or 0):%d",randpermute);
}
}
double tIO = MPI_Wtime();
Dist::MPI_DCCols A(MPI_COMM_WORLD); // construct object
if(isMatrixMarket)
A.ParallelReadMM(ifilename, base, maximum<double>());
else
A.ReadGeneralizedTuples(ifilename, maximum<double>());
A.PrintInfo();
Dist::MPI_DCCols AT = A;
AT.Transpose();
if(!(AT == A))
{
SpParHelper::Print("Symmatricizing an unsymmetric input matrix.\n");
A += AT;
}
A.PrintInfo();
ostringstream outs;
outs << "File Read time: " << MPI_Wtime() - tIO << endl;
SpParHelper::Print(outs.str());
if(randpermute && isMatrixMarket) // no need for GeneralizedTuples
{
// randomly permute for load balance
if(A.getnrow() == A.getncol())
{
FullyDistVec<int64_t, int64_t> p( A.getcommgrid());
p.iota(A.getnrow(), 0);
p.RandPerm();
(A)(p,p,true);// in-place permute to save memory
SpParHelper::Print("Applied symmetric permutation.\n");
}
else
{
SpParHelper::Print("Rectangular matrix: Can not apply symmetric permutation.\n");
}
}
/*
FullyDistVec<int64_t,double> ColSums = A.Reduce(Column, plus<double>(), 0.0);
FullyDistVec<int64_t, int64_t> isov = ColSums.FindInds(bind2nd(equal_to<double>(), 0));
outs.str("");
outs.clear();
outs << "isolated vertice: " << isov.TotalLength() << endl;
SpParHelper::Print(outs.str());
*/
float balance = A.LoadImbalance();
int64_t nnz = A.getnnz();
outs.str("");
outs.clear();
outs << "Load balance: " << balance << endl;
outs << "Nonzeros: " << nnz << endl;
SpParHelper::Print(outs.str());
double t1 = MPI_Wtime();
int64_t nCC = 0;
FullyDistVec<int64_t, int64_t> cclabels = CC(A, nCC);
double t2 = MPI_Wtime();
string outname = ifilename + ".components";
cclabels.ParallelWrite(outname, 1);
//outs.str("");
//outs.clear();
//outs << "Total time: " << t2 - t1 << endl;
//SpParHelper::Print(outs.str());
//HistCC(cclabels, nCC);
int64_t nclusters = cclabels.Reduce(maximum<int64_t>(), (int64_t) 0 ) ;
nclusters ++; // because of zero based indexing for clusters
double tend = MPI_Wtime();
stringstream s2;
s2 << "Number of clusters: " << nclusters << endl;
s2 << "Total time: " << (t2-t1) << endl;
s2 << "=================================================\n" << endl ;
SpParHelper::Print(s2.str());
}
MPI_Finalize();
return 0;
}
|
