Brick Library 0.1
Performance-portable stencil datalayout & codegen
Loading...
Searching...
No Matches
Functions | Variables
brick-mpi.cpp File Reference
#include "brick-mpi.h"
Include dependency graph for brick-mpi.cpp:

Functions

void allneighbors (BitSet cur, long idx, long dim, std::vector< BitSet > &neighbors)
 Enumerate all neighbors.
 

Variables

double packtime
 
double calltime
 
double waittime
 
double movetime
 
double calctime
 
std::vector< BitSetskin3d_good
 Optimized surface ordering for 3D.
 
std::vector< BitSetskin3d_normal
 
std::vector< BitSetskin3d_bad
 

Function Documentation

◆ allneighbors()

void allneighbors ( BitSet  cur,
long  idx,
long  dim,
std::vector< BitSet > &  neighbors 
)

Enumerate all neighbors.

Parameters
[in]curusually 0
[in]idxcurrent dimension, starts from 1
[in]dimtotal number of dimensions
[out]neighborsa list of neighbors
Here is the call graph for this function:

Variable Documentation

◆ calctime

double calctime

◆ calltime

double calltime

◆ movetime

double movetime

◆ packtime

double packtime

◆ skin3d_bad

std::vector<BitSet> skin3d_bad

◆ skin3d_good

std::vector<BitSet> skin3d_good
Initial value:
= {
{1},
{1, -3},
{1, 2, -3},
{1, 2},
{1, 2, 3},
{2, 3},
{2},
{2, -3},
{-1, 2, -3},
{-1, 2},
{-1, 2, 3},
{-1, 3},
{-1},
{-3},
{-1, -3},
{-1, -2, -3},
{-1, -2},
{-1, -2, 3},
{-2, 3},
{-2},
{-2, -3},
{1, -2, -3},
{1, -2},
{1, -2, 3},
{1, 3},
{3}
}

Optimized surface ordering for 3D.

BrickDecomp<3, 8,8,8> bDecomp({128,128,128}, 8);
std::vector< BitSet > skin3d_good
Optimized surface ordering for 3D.
Definition: brick-mpi.cpp:25
Decomposition for MPI communication.
Definition: brick-mpi.h:180
void initialize(const std::vector< BitSet > &skinlist)
initialize the decomposition using skinlist
Definition: brick-mpi.h:322

◆ skin3d_normal

std::vector<BitSet> skin3d_normal
Initial value:
= {
{-1, -2, -3},
{-2, -3},
{1, -2, -3},
{-1, -3},
{-3},
{1, -3},
{-1, 2, -3},
{2, -3},
{1, 2, -3},
{-1, -2},
{-2},
{1, -2},
{-1},
{},
{1},
{-1, 2},
{2},
{1, 2},
{-1, -2, 3},
{-2, 3},
{1, -2, 3},
{-1, 3},
{3},
{1, 3},
{-1, 2, 3},
{2, 3},
{1, 2, 3}
}

◆ waittime

double waittime