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 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670
|
/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* 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
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 "SpParMat3D.h"
#include "ParFriends.h"
#include "Operations.h"
#include "FileHeader.h"
extern "C" {
#include "mmio.h"
}
#include <sys/types.h>
#include <sys/stat.h>
#include <mpi.h>
#include <fstream>
#include <algorithm>
#include <set>
#include <stdexcept>
#include <string>
#include "CombBLAS/CombBLAS.h"
#include <unistd.h>
namespace combblas
{
template <class IT, class NT>
std::tuple<IT,IT,NT>* ExchangeData(std::vector<std::vector<std::tuple<IT,IT,NT>>> & tempTuples, MPI_Comm World, IT& datasize)
{
/* Create/allocate variables for vector assignment */
MPI_Datatype MPI_tuple;
MPI_Type_contiguous(sizeof(std::tuple<IT,IT,NT>), MPI_CHAR, &MPI_tuple);
MPI_Type_commit(&MPI_tuple);
int nprocs;
MPI_Comm_size(World, &nprocs);
int * sendcnt = new int[nprocs];
int * recvcnt = new int[nprocs];
int * sdispls = new int[nprocs]();
int * rdispls = new int[nprocs]();
// Set the newly found vector entries
IT totsend = 0;
for(IT i=0; i<nprocs; ++i)
{
sendcnt[i] = tempTuples[i].size();
totsend += tempTuples[i].size();
}
MPI_Alltoall(sendcnt, 1, MPI_INT, recvcnt, 1, MPI_INT, World);
std::partial_sum(sendcnt, sendcnt+nprocs-1, sdispls+1);
std::partial_sum(recvcnt, recvcnt+nprocs-1, rdispls+1);
IT totrecv = std::accumulate(recvcnt,recvcnt+nprocs, static_cast<IT>(0));
std::vector< std::tuple<IT,IT,NT> > sendTuples(totsend);
for(int i=0; i<nprocs; ++i)
{
copy(tempTuples[i].begin(), tempTuples[i].end(), sendTuples.data()+sdispls[i]);
std::vector< std::tuple<IT,IT,NT> >().swap(tempTuples[i]); // clear memory
}
std::tuple<IT,IT,NT>* recvTuples = new std::tuple<IT,IT,NT>[totrecv];
//std::vector< std::tuple<IT,IT,NT> > recvTuples(totrecv);
MPI_Alltoallv(sendTuples.data(), sendcnt, sdispls, MPI_tuple, recvTuples, recvcnt, rdispls, MPI_tuple, World);
DeleteAll(sendcnt, recvcnt, sdispls, rdispls); // free all memory
MPI_Type_free(&MPI_tuple);
datasize = totrecv;
return recvTuples;
}
template <class IT, class NT, class DER>
void SpecialExchangeData( std::vector<DER> & sendChunks, MPI_Comm World, IT& datasize, NT dummy, vector<DER> & recvChunks){
int myrank;
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
double vm_usage, resident_set;
typedef typename DER::LocalIT LIT;
int numChunks = sendChunks.size();
MPI_Datatype MPI_tuple;
MPI_Type_contiguous(sizeof(std::tuple<LIT,LIT,NT>), MPI_CHAR, &MPI_tuple);
MPI_Type_commit(&MPI_tuple);
int * sendcnt = new int[numChunks];
int * sendprfl = new int[numChunks*3];
int * sdispls = new int[numChunks]();
int * recvcnt = new int[numChunks];
int * recvprfl = new int[numChunks*3];
int * rdispls = new int[numChunks]();
IT totsend = 0;
for(IT i=0; i<numChunks; ++i){
sendprfl[i*3] = sendChunks[i].getnnz();
sendprfl[i*3+1] = sendChunks[i].getnrow();
sendprfl[i*3+2] = sendChunks[i].getncol();
sendcnt[i] = sendprfl[i*3];
totsend += sendcnt[i];
}
MPI_Alltoall(sendprfl, 3, MPI_INT, recvprfl, 3, MPI_INT, World);
for(int i = 0; i < numChunks; i++) recvcnt[i] = recvprfl[i*3];
std::partial_sum(sendcnt, sendcnt+numChunks-1, sdispls+1);
std::partial_sum(recvcnt, recvcnt+numChunks-1, rdispls+1);
IT totrecv = std::accumulate(recvcnt,recvcnt+numChunks, static_cast<IT>(0));
std::tuple<LIT,LIT,NT>* sendTuples = new std::tuple<LIT,LIT,NT>[totsend];
std::tuple<LIT,LIT,NT>* recvTuples = new std::tuple<LIT,LIT,NT>[totrecv];
int kk=0;
for(int i = 0; i < numChunks; i++){
for(typename DER::SpColIter colit = sendChunks[i].begcol(); colit != sendChunks[i].endcol(); ++colit){
for(typename DER::SpColIter::NzIter nzit = sendChunks[i].begnz(colit); nzit != sendChunks[i].endnz(colit); ++nzit){
NT val = nzit.value();
sendTuples[kk++] = std::make_tuple(nzit.rowid(), colit.colid(), nzit.value());
}
}
}
MPI_Alltoallv(sendTuples, sendcnt, sdispls, MPI_tuple, recvTuples, recvcnt, rdispls, MPI_tuple, World);
DeleteAll(sendcnt, sendprfl, sdispls, sendTuples);
//tuple<LIT, LIT, NT> ** tempTuples = new tuple<LIT, LIT, NT>*[numChunks];
tuple<LIT, LIT, NT> ** tempTuples = new tuple<LIT, LIT, NT>*[numChunks];
for (int i = 0; i < numChunks; i++){
tempTuples[i] = new tuple<LIT, LIT, NT>[recvcnt[i]];
memcpy(tempTuples[i], recvTuples+rdispls[i], recvcnt[i]*sizeof(tuple<LIT, LIT, NT>));
}
for (int i = 0; i < numChunks; i++){
recvChunks.push_back(DER(SpTuples<LIT, NT>(recvcnt[i], recvprfl[i*3+1], recvprfl[i*3+2], tempTuples[i]), false));
}
// Free all memory except tempTuples; Because that memory is holding data of newly created local matrices after receiving.
DeleteAll(recvcnt, recvprfl, rdispls, recvTuples);
MPI_Type_free(&MPI_tuple);
return;
}
template <class IT, class NT, class DER>
SpParMat3D<IT, NT, DER>::~SpParMat3D(){
// No need to delete layermat because it is a smart pointer
//delete layermat;
}
// Empty contructor. Nothing is specified. Use with caution!
template <class IT, class NT, class DER>
SpParMat3D< IT,NT,DER >::SpParMat3D (int nlayers): nlayers(nlayers), colsplit(true), special(false){
assert( (sizeof(IT) >= sizeof(typename DER::LocalIT)) );
commGrid3D.reset(new CommGrid3D(MPI_COMM_WORLD, nlayers, 0, 0, special));
layermat.reset(new SpParMat<IT, NT, DER>(commGrid3D->GetLayerWorld()));
}
template <class IT, class NT, class DER>
SpParMat3D< IT,NT,DER >::SpParMat3D (DER * localMatrix, std::shared_ptr<CommGrid3D> grid3d, bool colsplit, bool special): commGrid3D(grid3d), colsplit(colsplit), special(special){
assert( (sizeof(IT) >= sizeof(typename DER::LocalIT)) );
MPI_Comm_size(commGrid3D->GetFiberWorld(), &nlayers);
layermat.reset(new SpParMat<IT, NT, DER>(localMatrix, commGrid3D->GetLayerWorld()));
}
template <class IT, class NT, class DER>
SpParMat3D< IT,NT,DER >::SpParMat3D (const SpParMat< IT,NT,DER > & A2D, int nlayers, bool colsplit, bool special): nlayers(nlayers), colsplit(colsplit), special(special){
typedef typename DER::LocalIT LIT;
auto commGrid2D = A2D.getcommgrid();
int nprocs = commGrid2D->GetSize();
commGrid3D.reset(new CommGrid3D(commGrid2D->GetWorld(), nlayers, 0, 0, special));
if(special){
DER* spSeq = A2D.seqptr(); // local submatrix
std::vector<DER> localChunks;
int numChunks = (int)std::sqrt((float)commGrid3D->GetGridLayers());
if(!colsplit) spSeq->Transpose();
spSeq->ColSplit(numChunks, localChunks);
if(!colsplit){
for(int i = 0; i < localChunks.size(); i++) localChunks[i].Transpose();
}
// Some necessary processing before exchanging data
int sqrtLayer = (int)std::sqrt((float)commGrid3D->GetGridLayers());
std::vector<DER> sendChunks(commGrid3D->GetGridLayers());
for(int i = 0; i < sendChunks.size(); i++){
sendChunks[i] = DER(0, 0, 0, 0);
}
for(int i = 0; i < localChunks.size(); i++){
int rcvRankInFiber = (colsplit) ? ( ( ( commGrid3D->GetRankInFiber() / sqrtLayer ) * sqrtLayer ) + i ) : ( ( ( commGrid3D->GetRankInFiber() % sqrtLayer ) * sqrtLayer ) + i );
sendChunks[rcvRankInFiber] = localChunks[i];
}
MPI_Barrier(commGrid3D->GetWorld());
IT datasize; NT x = 0.0;
std::vector<DER> recvChunks;
SpecialExchangeData(sendChunks, commGrid3D->GetFiberWorld(), datasize, x, recvChunks);
typename DER::LocalIT concat_row = 0, concat_col = 0;
for(int i = 0; i < recvChunks.size(); i++){
if(colsplit) recvChunks[i].Transpose();
concat_row = std::max(concat_row, recvChunks[i].getnrow());
concat_col = concat_col + recvChunks[i].getncol();
}
DER * localMatrix = new DER(0, concat_row, concat_col, 0);
localMatrix->ColConcatenate(recvChunks);
if(colsplit) localMatrix->Transpose();
//layermat = new SpParMat<IT, NT, DER>(localMatrix, commGrid3D->GetLayerWorld());
layermat.reset(new SpParMat<IT, NT, DER>(localMatrix, commGrid3D->GetLayerWorld()));
}
else {
IT nrows = A2D.getnrow();
IT ncols = A2D.getncol();
int pr2d = commGrid2D->GetGridRows();
int pc2d = commGrid2D->GetGridCols();
int rowrank2d = commGrid2D->GetRankInProcRow();
int colrank2d = commGrid2D->GetRankInProcCol();
IT m_perproc2d = nrows / pr2d;
IT n_perproc2d = ncols / pc2d;
DER* spSeq = A2D.seqptr(); // local submatrix
IT localRowStart2d = colrank2d * m_perproc2d; // first row in this process
IT localColStart2d = rowrank2d * n_perproc2d; // first col in this process
LIT lrow3d, lcol3d;
std::vector<IT> tsendcnt(nprocs,0);
for(typename DER::SpColIter colit = spSeq->begcol(); colit != spSeq->endcol(); ++colit)
{
IT gcol = colit.colid() + localColStart2d;
for(typename DER::SpColIter::NzIter nzit = spSeq->begnz(colit); nzit != spSeq->endnz(colit); ++nzit)
{
IT grow = nzit.rowid() + localRowStart2d;
int owner = Owner(nrows, ncols, grow, gcol, lrow3d, lcol3d); //3D owner
tsendcnt[owner]++;
}
}
std::vector< std::vector< std::tuple<LIT,LIT, NT> > > sendTuples (nprocs);
for(typename DER::SpColIter colit = spSeq->begcol(); colit != spSeq->endcol(); ++colit)
{
IT gcol = colit.colid() + localColStart2d;
for(typename DER::SpColIter::NzIter nzit = spSeq->begnz(colit); nzit != spSeq->endnz(colit); ++nzit)
{
IT grow = nzit.rowid() + localRowStart2d;
NT val = nzit.value();
int owner = Owner(nrows, ncols, grow, gcol, lrow3d, lcol3d); //3D owner
sendTuples[owner].push_back(std::make_tuple(lrow3d, lcol3d, val));
}
}
LIT datasize;
std::tuple<LIT,LIT,NT>* recvTuples = ExchangeData(sendTuples, commGrid2D->GetWorld(), datasize);
IT mdim, ndim;
LocalDim(nrows, ncols, mdim, ndim);
SpTuples<LIT, NT>spTuples3d(datasize, mdim, ndim, recvTuples);
DER * localm3d = new DER(spTuples3d, false);
//layermat = new SpParMat<IT, NT, DER>(localm3d, commGrid3D->GetCommGridLayer());
layermat.reset(new SpParMat<IT, NT, DER>(localm3d, commGrid3D->GetCommGridLayer()));
}
}
// Create a new copy of a 3D matrix in row split or column split manner
template <class IT, class NT, class DER>
SpParMat3D< IT,NT,DER >::SpParMat3D (const SpParMat3D< IT,NT,DER > & A, bool colsplit): colsplit(colsplit){
int myrank;
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
typedef typename DER::LocalIT LIT;
auto AcommGrid3D = A.getcommgrid3D();
int nprocs = AcommGrid3D->GetSize();
commGrid3D.reset(new CommGrid3D(AcommGrid3D->GetWorld(), AcommGrid3D->GetGridLayers(), 0, 0, A.isSpecial()));
// Intialize these two variables for new SpParMat3D
special = A.isSpecial();
nlayers = AcommGrid3D->GetGridLayers();
DER * spSeq = A.seqptr(); // local submatrix
DER * localMatrix = new DER(*spSeq);
if((A.isColSplit() && !colsplit) || (!A.isColSplit() && colsplit)){
// If given matrix is column split and desired matrix is row split
// Or if given matrix is row split and desired matrix is column split
std::vector<DER> sendChunks;
int numChunks = commGrid3D->GetGridLayers();
if(!colsplit) localMatrix->Transpose();
localMatrix->ColSplit(numChunks, sendChunks);
if(!colsplit){
for(int i = 0; i < sendChunks.size(); i++) sendChunks[i].Transpose();
}
IT datasize; NT x = 71.0;
std::vector<DER> recvChunks;
SpecialExchangeData(sendChunks, commGrid3D->GetFiberWorld(), datasize, x, recvChunks);
typename DER::LocalIT concat_row = 0, concat_col = 0;
for(int i = 0; i < recvChunks.size(); i++){
if(colsplit) recvChunks[i].Transpose();
concat_row = std::max(concat_row, recvChunks[i].getnrow());
concat_col = concat_col + recvChunks[i].getncol();
}
localMatrix = new DER(0, concat_row, concat_col, 0);
localMatrix->ColConcatenate(recvChunks);
if(colsplit) localMatrix->Transpose();
}
else{
// If given and desired matrix both are row split
// Or if given and desired matrix both are column split
// Do nothing
}
//layermat = new SpParMat<IT, NT, DER>(localMatrix, commGrid3D->GetLayerWorld());
layermat.reset(new SpParMat<IT, NT, DER>(localMatrix, commGrid3D->GetLayerWorld()));
}
/*
* Only calculates owner in terms of non-special distribution
* */
template <class IT, class NT,class DER>
template <typename LIT>
int SpParMat3D<IT,NT,DER>::Owner(IT total_m, IT total_n, IT grow, IT gcol, LIT & lrow, LIT & lcol) const {
// first map to Layer 0
std::shared_ptr<CommGrid> commGridLayer = commGrid3D->GetCommGridLayer(); // CommGrid for my layer
int procrows = commGridLayer->GetGridRows();
int proccols = commGridLayer->GetGridCols();
int nlayers = commGrid3D->GetGridLayers();
IT m_perproc_L0 = total_m / procrows;
IT n_perproc_L0 = total_n / proccols;
int procrow_L0; // within a layer
if(m_perproc_L0 != 0){
procrow_L0 = std::min(static_cast<int>(grow / m_perproc_L0), procrows-1);
}
else{
// all owned by the last processor row
procrow_L0 = procrows -1;
}
int proccol_L0;
if(n_perproc_L0 != 0){
proccol_L0 = std::min(static_cast<int>(gcol / n_perproc_L0), proccols-1);
}
else{
proccol_L0 = proccols-1;
}
IT lrow_L0 = grow - (procrow_L0 * m_perproc_L0);
IT lcol_L0 = gcol - (proccol_L0 * n_perproc_L0);
int layer;
// next, split and scatter
if(colsplit){
IT n_perproc;
if(proccol_L0 < commGrid3D->GetGridCols()-1)
n_perproc = n_perproc_L0 / nlayers;
else
n_perproc = (total_n - (n_perproc_L0 * proccol_L0)) / nlayers;
if(n_perproc != 0)
layer = std::min(static_cast<int>(lcol_L0 / n_perproc), nlayers-1);
else
layer = nlayers-1;
lrow = lrow_L0;
lcol = lcol_L0 - (layer * n_perproc);
}
else{
IT m_perproc;
if(procrow_L0 < commGrid3D->GetGridRows()-1)
m_perproc = m_perproc_L0 / nlayers;
else
m_perproc = (total_m - (m_perproc_L0 * procrow_L0)) / nlayers;
if(m_perproc != 0)
layer = std::min(static_cast<int>(lrow_L0 / m_perproc), nlayers-1);
else
layer = nlayers-1;
lcol = lcol_L0;
lrow = lrow_L0 - (layer * m_perproc);
}
int proccol_layer = proccol_L0;
int procrow_layer = procrow_L0;
return commGrid3D->GetRank(layer, procrow_layer, proccol_layer);
}
template <class IT, class NT,class DER>
void SpParMat3D<IT,NT,DER>::LocalDim(IT total_m, IT total_n, IT &localm, IT& localn) const
{
// first map to Layer 0 and then split
std::shared_ptr<CommGrid> commGridLayer = commGrid3D->GetCommGridLayer(); // CommGrid for my layer
int procrows = commGridLayer->GetGridRows();
int proccols = commGridLayer->GetGridCols();
int nlayers = commGrid3D->GetGridLayers();
IT localm_L0 = total_m / procrows;
IT localn_L0 = total_n / proccols;
if(commGridLayer->GetRankInProcRow() == commGrid3D->GetGridCols()-1)
{
localn_L0 = (total_n - localn_L0*(commGrid3D->GetGridCols()-1));
}
if(commGridLayer->GetRankInProcCol() == commGrid3D->GetGridRows()-1)
{
localm_L0 = (total_m - localm_L0 * (commGrid3D->GetGridRows()-1));
}
if(colsplit)
{
localn = localn_L0/nlayers;
if(commGrid3D->GetRankInFiber() == (commGrid3D->GetGridLayers()-1))
localn = localn_L0 - localn * (commGrid3D->GetGridLayers()-1);
localm = localm_L0;
}
else
{
localm = localm_L0/nlayers;
if(commGrid3D->GetRankInFiber() == (commGrid3D->GetGridLayers()-1))
localm = localm_L0 - localm * (commGrid3D->GetGridLayers()-1);
localn = localn_L0;
}
}
template <class IT, class NT, class DER>
SpParMat<IT, NT, DER> SpParMat3D<IT, NT, DER>::Convert2D(){
typedef typename DER::LocalIT LIT;
if(special){
DER * spSeq = layermat->seqptr();
std::vector<DER> localChunks;
int sqrtLayers = (int)std::sqrt((float)commGrid3D->GetGridLayers());
LIT grid3dCols = commGrid3D->GetGridCols(); LIT grid3dRows = commGrid3D->GetGridRows();
LIT grid2dCols = grid3dCols * sqrtLayers; LIT grid2dRows = grid3dRows * sqrtLayers;
IT x = (colsplit) ? layermat->getnrow() : layermat->getncol();
LIT y = (colsplit) ? (x / grid2dRows) : (x / grid2dCols);
vector<LIT> divisions2d;
if(colsplit){
for(LIT i = 0; i < grid2dRows-1; i++) divisions2d.push_back(y);
divisions2d.push_back(layermat->getnrow()-(grid2dRows-1)*y);
}
else{
for(LIT i = 0; i < grid2dCols-1; i++) divisions2d.push_back(y);
divisions2d.push_back(layermat->getncol()-(grid2dCols-1)*y);
}
vector<LIT> divisions2dChunk;
LIT start = (colsplit) ? ((commGrid3D->GetRankInLayer() / grid3dRows) * sqrtLayers) : ((commGrid3D->GetRankInLayer() % grid3dCols) * sqrtLayers);
LIT end = start + sqrtLayers;
for(LIT i = start; i < end; i++){
divisions2dChunk.push_back(divisions2d[i]);
}
if(colsplit) spSeq->Transpose();
spSeq->ColSplit(divisions2dChunk, localChunks);
if(colsplit){
for(int i = 0; i < localChunks.size(); i++) localChunks[i].Transpose();
}
std::vector<DER> sendChunks(commGrid3D->GetGridLayers());
for(int i = 0; i < sendChunks.size(); i++){
sendChunks[i] = DER(0, 0, 0, 0);
}
for(int i = 0; i < localChunks.size(); i++){
int rcvRankInFiber = (colsplit) ? ( ( ( commGrid3D->GetRankInFiber() / sqrtLayers ) * sqrtLayers ) + i ) : ( ( ( commGrid3D->GetRankInFiber() % sqrtLayers ) * sqrtLayers ) + i );
sendChunks[rcvRankInFiber] = localChunks[i];
}
IT datasize; NT z=1.0;
std::vector<DER> recvChunks;
SpecialExchangeData(sendChunks, commGrid3D->GetFiberWorld(), datasize, z, recvChunks);
LIT concat_row = 0, concat_col = 0;
for(int i = 0; i < recvChunks.size(); i++){
if(!colsplit) recvChunks[i].Transpose();
concat_row = std::max(concat_row, recvChunks[i].getnrow());
concat_col = concat_col + recvChunks[i].getncol();
}
DER * localMatrix = new DER(0, concat_row, concat_col, 0);
localMatrix->ColConcatenate(recvChunks);
if(!colsplit) localMatrix->Transpose();
std::shared_ptr<CommGrid> grid2d;
grid2d.reset(new CommGrid(commGrid3D->GetWorld(), 0, 0));
SpParMat<IT, NT, DER> mat2D(localMatrix, grid2d);
return mat2D;
}
else{
int nProcs = commGrid3D->GetSize(); // Total number of processes in the process grid
int nGridLayers = commGrid3D->GetGridLayers(); // Number of layers in the process grid
int nGridCols = commGrid3D->GetGridCols(); // Number of process columns in a layer of the grid, which can be thought of L0
int nGridRows = commGrid3D->GetGridRows(); // Number of process rows in a layer of the grid, which can be thought of L0
int rankInProcCol_L0 = commGrid3D->GetCommGridLayer()->GetRankInProcCol();
int rankInProcRow_L0 = commGrid3D->GetCommGridLayer()->GetRankInProcRow();
IT m = getnrow(); // Total number of rows of the matrix
IT n = getncol(); // Total number of columns of the matrix
IT a = n / nGridCols;
IT b = n - (a * (nGridCols - 1));
IT c = m / nGridRows;
IT d = m - (c * (nGridRows - 1));
IT w = a / nGridLayers;
IT x = a - (w * (nGridLayers - 1));
IT y = b / nGridLayers;
IT z = b - (y * (nGridLayers - 1));
IT p = c / nGridLayers;
IT q = c - (p * (nGridLayers - 1));
IT r = d / nGridLayers;
IT s = d - (r * (nGridLayers - 1));
std::shared_ptr<CommGrid> grid2d;
grid2d.reset(new CommGrid(commGrid3D->GetWorld(), 0, 0));
SpParMat<IT, NT, DER> A2D (grid2d);
std::vector< std::vector < std::tuple<LIT,LIT,NT> > > data(nProcs);
DER* spSeq = layermat->seqptr(); // local submatrix
LIT locsize = 0;
for(typename DER::SpColIter colit = spSeq->begcol(); colit != spSeq->endcol(); ++colit){
LIT lcol = colit.colid();
for(typename DER::SpColIter::NzIter nzit = spSeq->begnz(colit); nzit != spSeq->endnz(colit); ++nzit){
LIT lrow = nzit.rowid();
NT val = nzit.value();
LIT lrow_L0, lcol_L0;
if(colsplit){
// If 3D distribution is column split
lrow_L0 = lrow;
if(commGrid3D->GetCommGridLayer()->GetRankInProcRow() < (nGridCols-1)){
// If this process is not last in the process column
lcol_L0 = w * commGrid3D->GetRankInFiber() + lcol;
}
else{
// If this process is last in the process column
lcol_L0 = y * commGrid3D->GetRankInFiber() + lcol;
}
}
else{
// If 3D distribution is rowsplit
lcol_L0 = lcol;
if(commGrid3D->GetCommGridLayer()->GetRankInProcCol() < (nGridRows-1)){
// If this process is not last in the process column
lrow_L0 = p * commGrid3D->GetRankInFiber() + lrow;
}
else{
// If this process is last in the process column
lrow_L0 = r * commGrid3D->GetRankInFiber() + lrow;
}
}
IT grow = commGrid3D->GetCommGridLayer()->GetRankInProcCol() * c + lrow_L0;
IT gcol = commGrid3D->GetCommGridLayer()->GetRankInProcRow() * a + lcol_L0;
LIT lrow2d, lcol2d;
int owner = A2D.Owner(m, n, grow, gcol, lrow2d, lcol2d);
data[owner].push_back(std::make_tuple(lrow2d,lcol2d,val));
locsize++;
}
}
A2D.SparseCommon(data, locsize, m, n, maximum<NT>());
return A2D;
}
}
/*
* Calculate, which process accross fiber should get how many columns
* if layer matrix of this 3D matrix is distributed in column split way
* */
template <class IT, class NT, class DER>
void SpParMat3D<IT,NT,DER>::CalculateColSplitDistributionOfLayer(vector<typename DER::LocalIT> & divisions3d){
if(special){
vector<IT> divisions2d;
int sqrtLayers = (int)std::sqrt((float)commGrid3D->GetGridLayers());
int grid3dCols = commGrid3D->GetGridCols();
int grid2dCols = grid3dCols * sqrtLayers;
IT x = (layermat)->getncol();
IT y = x / grid2dCols;
for(int i = 0; i < grid2dCols-1; i++) divisions2d.push_back(y);
divisions2d.push_back(x-(grid2dCols-1)*y);
vector<IT> divisions2dChunk;
IT start = (commGrid3D->GetRankInLayer() % grid3dCols) * sqrtLayers;
IT end = start + sqrtLayers;
for(int i = start; i < end; i++){
divisions2dChunk.push_back(divisions2d[i]);
}
for(int i = 0; i < divisions2dChunk.size(); i++){
IT z = divisions2dChunk[i]/sqrtLayers;
for(int j = 0; j < sqrtLayers-1; j++) divisions3d.push_back(z);
divisions3d.push_back(divisions2dChunk[i]-(sqrtLayers-1)*z);
}
}
else{
// For non-special distribution, partitioning for 3D can be achieved by dividing local columns in #layers equal partitions
IT x = layermat->seqptr()->getncol();
int nlayers = commGrid3D->GetGridLayers();
IT y = x / nlayers;
for(int i = 0; i < nlayers-1; i++) divisions3d.push_back(y);
divisions3d.push_back(x-(nlayers-1)*y);
}
}
/*
* Checks if the layer matrix is 2D SpParMat compatible
* */
template <class IT, class NT, class DER>
bool SpParMat3D<IT,NT,DER>::CheckSpParMatCompatibility(){
IT nLayerCols = layermat->getncol();
IT nLayerRows = layermat->getnrow();
IT localCols = layermat->getlocalcols();
IT localRows = layermat->getlocalrows();
int nGridCols = layermat->getcommgrid()->GetGridCols();
int nGridRows = layermat->getcommgrid()->GetGridRows();
int idxGridRow = layermat->getcommgrid()->GetRankInProcCol();
int idxGridCol = layermat->getcommgrid()->GetRankInProcRow();
IT x, y, a, b;
x = nLayerRows / nGridRows;
y = (nLayerRows % nGridRows == 0) ? x : (nLayerRows - x * (nGridRows - 1));
a = nLayerCols / nGridCols;
b = (nLayerCols % nGridCols == 0) ? a : (nLayerCols - a * (nGridCols - 1));
bool flag = true;
if(idxGridRow == nGridRows-1){
if(localRows != y) flag = false;
}
else{
if(localRows != x) flag = false;
}
if(idxGridCol == nGridCols-1){
if(localCols != b) flag = false;
}
else{
if(localCols != a) flag = false;
}
return flag;
}
template <class IT, class NT, class DER>
IT SpParMat3D< IT,NT,DER >::getnrow() const {
IT totalrows_layer = layermat->getnrow();
IT totalrows = 0;
if(!colsplit) MPI_Allreduce( &totalrows_layer, &totalrows, 1, MPIType<IT>(), MPI_SUM, commGrid3D->GetFiberWorld());
else totalrows = totalrows_layer;
return totalrows;
}
template <class IT, class NT, class DER>
IT SpParMat3D< IT,NT,DER >::getncol() const {
IT totalcols_layer = layermat->getncol();
IT totalcols = 0;
if(colsplit) MPI_Allreduce( &totalcols_layer, &totalcols, 1, MPIType<IT>(), MPI_SUM, commGrid3D->GetFiberWorld());
else totalcols = totalcols_layer;
return totalcols;
}
template <class IT, class NT, class DER>
IT SpParMat3D< IT,NT,DER >::getnnz() const {
IT totalnz_layer = layermat->getnnz();
IT totalnz = 0;
MPI_Allreduce( &totalnz_layer, &totalnz, 1, MPIType<IT>(), MPI_SUM, commGrid3D->GetFiberWorld());
return totalnz;
}
}
|