mpi rarray: improve setupBuffer
This commit is contained in:
parent
1d77098670
commit
af32689c00
5 changed files with 52 additions and 28 deletions
|
@ -393,8 +393,8 @@ namespace CNORXZ
|
|||
| non-member functions |
|
||||
+============================*/
|
||||
|
||||
template <class TarI, class RTarI, class SrcI, class RSrcI, typename T>
|
||||
void setupBuffer(const Sptr<RIndex<TarI,RTarI>>& rgi, const Sptr<RIndex<SrcI,RSrcI>>& rgj,
|
||||
template <class LoopI, class SrcI, class RSrcI, typename T>
|
||||
void setupBuffer(const Sptr<LoopI>& lpi, const Sptr<RIndex<SrcI,RSrcI>>& rgj,
|
||||
const Sptr<Vector<SizeT>>& imap, const CArrayBase<T>& data,
|
||||
Vector<T>& buf, Vector<const T*>& map, const SizeT blocks)
|
||||
{
|
||||
|
@ -408,17 +408,31 @@ namespace CNORXZ
|
|||
sb.reserve(data.size());
|
||||
}
|
||||
Vector<Vector<SizeT>> request(Nranks);
|
||||
const SizeT locsz = rgi->local()->lmax().val();
|
||||
const SizeT locsz = rgj->local()->lmax().val();
|
||||
|
||||
// First loop: setup send buffer
|
||||
rgi->ifor( mapXpr(rgj, rgi, imap,
|
||||
// ==== new ====
|
||||
|
||||
// First loop: Find out what's needed
|
||||
Vector<bool> required(rgj->lmax().val(),false);
|
||||
lpi->ifor( mapXpr(rgj, lpi, imap,
|
||||
operation
|
||||
( [&](SizeT p, SizeT q) {
|
||||
const SizeT r = p / locsz;
|
||||
( [&](SizeT j) {
|
||||
const SizeT r = j / locsz;
|
||||
if(myrank != r){
|
||||
required[j] = true;
|
||||
}
|
||||
} , posop(rgj) ) ),
|
||||
NoF {} )();
|
||||
|
||||
// Second loop: setup send buffer
|
||||
auto mi = mindexPtr(rgj->rankI(), rgj->local());
|
||||
mi->ifor( operation
|
||||
( [&](SizeT p) {
|
||||
const SizeT r = p / locsz;
|
||||
if(myrank != r and required[p]){
|
||||
request[r].push_back(p % locsz);
|
||||
}
|
||||
} , posop(rgj), posop(rgi) ) ) ,
|
||||
} , posop(mi) ) ,
|
||||
NoF {} )();
|
||||
|
||||
// transfer:
|
||||
|
@ -470,13 +484,13 @@ namespace CNORXZ
|
|||
|
||||
}
|
||||
|
||||
// Second loop: Assign map to target buffer positions:
|
||||
// Third loop: Assign map to target buffer positions:
|
||||
Vector<SizeT> cnt(Nranks);
|
||||
rgi->ifor( mapXpr(rgj, rgi, imap,
|
||||
operation
|
||||
( [&](SizeT p, SizeT q) {
|
||||
mi->ifor( operation
|
||||
( [&](SizeT p) {
|
||||
const SizeT r = p / locsz;
|
||||
if(myrank != r){
|
||||
const SizeT l = p % locsz;
|
||||
if(myrank != r and required[p]){
|
||||
SizeT off = 0;
|
||||
for(SizeT s = 0; s != r; ++s){
|
||||
off += ext[myrank][s];
|
||||
|
@ -484,8 +498,10 @@ namespace CNORXZ
|
|||
map[p] = buf.data() + off*blocks + cnt[r]*blocks;
|
||||
++cnt[r];
|
||||
}
|
||||
map[q + myrank*locsz] = data.data() + q*blocks;
|
||||
} , posop(rgj), posop(rgi) ) ), NoF {} )();
|
||||
if(myrank == r){
|
||||
map[p] = data.data() + l*blocks;
|
||||
}
|
||||
} , posop(mi) ), NoF {} )();
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -244,8 +244,8 @@ namespace CNORXZ
|
|||
|
||||
};
|
||||
|
||||
template <class TarI, class RTarI, class SrcI, class RSrcI, typename T>
|
||||
void setupBuffer(const Sptr<RIndex<TarI,RTarI>>& rgj, const Sptr<RIndex<SrcI,RSrcI>>& rgi,
|
||||
template <class LoopI, class SrcI, class RSrcI, typename T>
|
||||
void setupBuffer(const Sptr<LoopI>& lpi, const Sptr<RIndex<SrcI,RSrcI>>& rgj,
|
||||
const Sptr<Vector<SizeT>>& imap, const CArrayBase<T>& data,
|
||||
Vector<T>& buf, Vector<const T*>& map, const SizeT blocks);
|
||||
|
||||
|
|
|
@ -376,6 +376,11 @@ namespace CNORXZ
|
|||
return mI;
|
||||
}
|
||||
|
||||
template <class IndexI, class IndexK>
|
||||
Sptr<IndexK> RIndex<IndexI,IndexK>::rankI() const
|
||||
{
|
||||
return mK;
|
||||
}
|
||||
|
||||
/*=====================+
|
||||
| RRangeFactory |
|
||||
|
|
|
@ -156,6 +156,9 @@ namespace CNORXZ
|
|||
/** Get the local index on THIS rank. */
|
||||
Sptr<IndexI> local() const;
|
||||
|
||||
/** Get index indicating the current rank this index points to. */
|
||||
Sptr<IndexK> rankI() const;
|
||||
|
||||
private:
|
||||
SizeT mLex = 0;
|
||||
Sptr<RangeType> mRange; /**< RRange. */
|
||||
|
|
|
@ -114,7 +114,7 @@ namespace
|
|||
setupBuffer(rgj, rgi, fmap, data, buf, map, mSRange->size());
|
||||
|
||||
EXPECT_EQ(mRRange->sub(1)->size(), 16*12*12*12/4);
|
||||
// Third loop: Check:
|
||||
// Fourth loop: Check:
|
||||
for(*rgi = 0, gi = 0; rgi->lex() != rgi->lmax().val(); ++*rgi, ++gi){
|
||||
gj = gi.lex();
|
||||
*gj.pack()[C0] = (gj.pack()[C0]->lex() + 1) % gj.pack()[C0]->lmax().val();
|
||||
|
|
Loading…
Reference in a new issue