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
|
/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.5 -------------------------------------------------*/
/* date: 10/09/2015 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc, Adam Lugowski ------------*/
/****************************************************************/
/*
Copyright (c) 2010-2015, 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.
*/
#ifndef _COMM_GRID_H_
#define _COMM_GRID_H_
#include <iostream>
#include <cmath>
#include <cassert>
#include <mpi.h>
#include <sstream>
#include <string>
#include <fstream>
#include <stdint.h>
#include "MPIType.h"
namespace combblas {
class CommGrid
{
public:
CommGrid(MPI_Comm world, int nrowproc, int ncolproc);
~CommGrid()
{
MPI_Comm_free(&commWorld);
MPI_Comm_free(&rowWorld);
MPI_Comm_free(&colWorld);
if(grrows == grcols) {
if(diagWorld != MPI_COMM_NULL) MPI_Comm_free(&diagWorld);
}
}
CommGrid (const CommGrid & rhs): grrows(rhs.grrows), grcols(rhs.grcols),
myprocrow(rhs.myprocrow), myproccol(rhs.myproccol), myrank(rhs.myrank) // copy constructor
{
MPI_Comm_dup(rhs.commWorld, &commWorld);
MPI_Comm_dup(rhs.rowWorld, &rowWorld);
MPI_Comm_dup(rhs.colWorld, &colWorld);
// don't use the shortcut ternary ? operator, C++ syntax fails as
// mpich implements MPI::COMM_NULL of different type than MPI::IntraComm
if(rhs.diagWorld == MPI_COMM_NULL)
diagWorld = MPI_COMM_NULL;
else
MPI_Comm_dup(rhs.diagWorld,&diagWorld);
}
CommGrid & operator=(const CommGrid & rhs) // assignment operator
{
if(this != &rhs)
{
MPI_Comm_free(&commWorld);
MPI_Comm_free(&rowWorld);
MPI_Comm_free(&colWorld);
grrows = rhs.grrows;
grcols = rhs.grcols;
myrank = rhs.myrank;
myprocrow = rhs.myprocrow;
myproccol = rhs.myproccol;
MPI_Comm_dup(rhs.commWorld, &commWorld);
MPI_Comm_dup(rhs.rowWorld, &rowWorld);
MPI_Comm_dup(rhs.colWorld, &colWorld);
if(rhs.diagWorld == MPI_COMM_NULL) diagWorld = MPI_COMM_NULL;
else MPI_Comm_dup(rhs.diagWorld,&diagWorld);
}
return *this;
}
void CreateDiagWorld();
bool operator== (const CommGrid & rhs) const;
bool operator!= (const CommGrid & rhs) const
{
return (! (*this == rhs));
}
bool OnSameProcCol( int rhsrank );
bool OnSameProcRow( int rhsrank );
int GetRank(int rowrank, int colrank) { return rowrank * grcols + colrank; }
int GetRank(int diagrank) { return diagrank * grcols + diagrank; }
int GetRank() { return myrank; }
int GetRankInProcRow() { return myproccol; }
int GetRankInProcCol() { return myprocrow; }
int GetDiagRank()
{
int rank;
MPI_Comm_rank(diagWorld, &rank);
return rank;
}
int GetRankInProcRow(int wholerank);
int GetRankInProcCol(int wholerank);
int GetDiagOfProcRow();
int GetDiagOfProcCol();
int GetComplementRank() // For P(i,j), get rank of P(j,i)
{
return ((grcols * myproccol) + myprocrow);
}
MPI_Comm & GetWorld() { return commWorld; }
MPI_Comm & GetRowWorld() { return rowWorld; }
MPI_Comm & GetColWorld() { return colWorld; }
MPI_Comm & GetDiagWorld() { return diagWorld; }
MPI_Comm GetWorld() const { return commWorld; }
MPI_Comm GetRowWorld() const { return rowWorld; }
MPI_Comm GetColWorld() const { return colWorld; }
MPI_Comm GetDiagWorld() const { return diagWorld; }
int GetGridRows() { return grrows; }
int GetGridCols() { return grcols; }
int GetSize() { return grrows * grcols; }
int GetDiagSize()
{
int size;
MPI_Comm_size(diagWorld, &size);
return size;
}
void OpenDebugFile(std::string prefix, std::ofstream & output) const;
friend std::shared_ptr<CommGrid> ProductGrid(CommGrid * gridA, CommGrid * gridB, int & innerdim, int & Aoffset, int & Boffset);
private:
// A "normal" MPI-1 communicator is an intracommunicator; MPI::COMM_WORLD is also an MPI::Intracomm object
MPI_Comm commWorld, rowWorld, colWorld, diagWorld;
// Processor grid is (grrow X grcol)
int grrows, grcols;
int myprocrow;
int myproccol;
int myrank;
template <class IT, class NT, class DER>
friend class SpParMat;
template <class IT, class NT>
friend class FullyDistSpVec;
};
}
#endif
|
