portelli/Grid
1
0
Fork 0
mirror of https://github.com/paboyle/Grid.git synced 2024-11-10 07:55:35 +00:00
Code Releases Activity

More careful sequencing of comms

Browse Source
This commit is contained in:
Peter Boyle 2016-02-15 16:04:59 -06:00
parent f7be108e35
commit 340a29b735
1 changed files with 31 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
lib/Stencil.h
View File

@ -112,10 +112,10 @@ namespace Grid {
comms_bytes+=2.0*bytes;
Packets.push_back(p);
}
/*
#undef SERIAL_SENDS
#ifdef SERIAL_SENDS
void Communicate(void ) {
// typedef CartesianCommunicator::CommsRequest_t CommsRequest_t;
// std::vector<CommsRequest_t> reqs(0);
commtime-=usecond();
for(int i=0;i<Packets.size();i++){
_grid->SendToRecvFrom(
@ -126,28 +126,42 @@ namespace Grid {
Packets[i].bytes);
Packets[i].done = 1;
}
// _grid->SendToRecvFromComplete(reqs);
commtime+=usecond();
}
*/
#else
void Communicate(void ) {
typedef CartesianCommunicator::CommsRequest_t CommsRequest_t;
std::vector<CommsRequest_t> reqs(0);
std::vector<std::vector<CommsRequest_t> > reqs(Packets.size());
commtime-=usecond();
for(int i=0;i<Packets.size();i++){
_grid->SendToRecvFromBegin(reqs,
Packets[i].send_buf,
Packets[i].to_rank,
Packets[i].recv_buf,
Packets[i].from_rank,
Packets[i].bytes);
const int concurrency=2;
for(int i=0;i<Packets.size();i+=concurrency){
for(int ii=0;ii<concurrency;ii++){
int j = i+ii;
if ( j<Packets.size() ) {
_grid->SendToRecvFromBegin(reqs[j],
Packets[j].send_buf,
Packets[j].to_rank,
Packets[j].recv_buf,
Packets[j].from_rank,
Packets[j].bytes);
}
}
for(int ii=0;ii<concurrency;ii++){
int j = i+ii;
if ( j<Packets.size() ) {
_grid->SendToRecvFromComplete(reqs[i]);
}
}
for(int ii=0;ii<concurrency;ii++){
int j = i+ii;
if ( j<Packets.size() ) {
Packets[j].done = 1;
}
}
}
_grid->SendToRecvFromComplete(reqs);
commtime+=usecond();
for(int i=0;i<Packets.size();i++){
Packets[i].done = 1;
}
}
#endif
///////////////////////////////////////////
// Simd merge queue for asynch comms