ComputeGridForceNodeMgr Class Reference

#include <ComputeGridForce.h>

List of all members.

Public Member Functions
	ComputeGridForceNodeMgr ()
void	depositInitialGrid (GridDepositMsg *msg)
void	requestInitialGridData ()
void	receiveInitialGridData (GridSegmentMsg *msg)
void	submitRequest (SubReqMsg *msg)
void	fetchGridValues (GridRequestMsg *msg)
void	recvGridValues (GridValuesMsg *msg)
void	resume ()

---

Constructor & Destructor Documentation

ComputeGridForceNodeMgr::ComputeGridForceNodeMgr (   )

Definition at line 23 of file ComputeGridForce.C. { CkpvAccess(BOCclass_group).computeGridForceNodeMgr = thisgroup; grids_deposited = 0; grids = NULL; requestGrids_count = 0; myNode = CkMyNode(); nodeSize = CkNodeSize(myNode); gf = new ComputeGridForce*[nodeSize]; proc_count = 0; cur_grid = 0; // myout = new infostream[nodeSize]; // iout << iINFO << "[" << CkMyPe() << "] GridForceNodeMgr created" // << " procs=" << CkNumPes() // << " nodes=" << CkNumNodes() // << " nodesize=" << CkNodeSize(CkMyNode()) // << "\n" << endi; }

---

Member Function Documentation

void ComputeGridForceNodeMgr::depositInitialGrid (  GridDepositMsg *  msg  )

Definition at line 43 of file ComputeGridForce.C. References GridDepositMsg::grid, GridDepositMsg::gridnum, GridforceGrid::init2(), and GridDepositMsg::num_grids. { const int gridnum = msg->gridnum; GridforceGrid *grid = msg->grid; num_grids = msg->num_grids; delete msg; // iout << iINFO << "[" << CkMyPe() << "] Grid " << gridnum // << " deposited\n" << endi; if (grids_deposited == 0) { // iout << iINFO << "[" << CkMyPe() << "] Allocating for " // << num_grids << " grids" // << "\n" << endi; grids = new GridforceGrid*[num_grids]; } grids[gridnum] = grid; grids_deposited++; if (grids_deposited == num_grids) { // iout << iINFO << "[" << CkMyPe() << "]" // << " all grids deposited\n" << endi; int i; for(i=0;i<num_grids; i++) { grids[i]->init2(); } // iout << iINFO << "[" << CkMyPe() << "]" // << " requesting from node 0" // << "\n" << endi; // Once all grids are deposited here, request grid data from node 0 CProxy_ComputeGridForceNodeMgr myproxy(thisgroup); myproxy[0].requestInitialGridData(); } }

void ComputeGridForceNodeMgr::fetchGridValues (  GridRequestMsg *  msg  )

Definition at line 243 of file ComputeGridForce.C. References GridRequestMsg::from_node, GridforceGrid::get_grid(), GridforceGrid::getBlockSize(), GridforceGrid::getIndexForBlock(), GridRequestMsg::gridIndexList, GridValuesMsg::gridStartIndex, GridRequestMsg::gridStartIndex, GridValuesMsg::gridVals, GridVal::index, j, GridValuesMsg::num_grid_indices, and GridVal::val. { // Be careful that this isn't running at the same time resume() is. // As long as this entry is exclusive, and resume() is only // called from an exclusive entry, this should be fine. // iout << iINFO << "[" << CkMyPe() << "] Getting grid values from " // << msg->from_node << " for " << msg->num_grid_indices // << " indices " // << "\n" << endi; int *startIndex = new int[num_grids+1]; startIndex[0] = 0; int gridnum; int i; for(gridnum=0;gridnum<num_grids;gridnum++) { int nvals = 0; for(i=msg->gridStartIndex[gridnum]; i < msg->gridStartIndex[gridnum+1]; i++) { const int block = msg->gridIndexList[i]; nvals += grids[gridnum]->getBlockSize(block); // iout << iINFO << "[" << CkMyPe() << "] grid block " // << block << " size is " // << nvals << "\n" << endi; } startIndex[gridnum+1] = startIndex[gridnum] + nvals; } GridValuesMsg *outmsg = new(num_grids+1,startIndex[num_grids]) GridValuesMsg; outmsg->num_grid_indices = startIndex[num_grids]; for(gridnum=0;gridnum<=num_grids;gridnum++) { // iout << iINFO << "[" << CkMyPe() << "] Grid start " // << startIndex[gridnum] // << "\n" << endi; outmsg->gridStartIndex[gridnum] = startIndex[gridnum]; } delete [] startIndex; // Molecule *mol = Node::Object()->molecule; for (gridnum = 0; gridnum < num_grids; gridnum++) { GridforceGrid* grid = grids[gridnum]; // iout << iINFO << "[" << CkMyPe() << "] filling grid from " // << msg->gridStartIndex[gridnum] // << " to " // << msg->gridStartIndex[gridnum+1] // << "\n" << endi; int outindex = outmsg->gridStartIndex[gridnum]; for(i=msg->gridStartIndex[gridnum]; i < msg->gridStartIndex[gridnum+1]; i++) { const int block = msg->gridIndexList[i]; int j; const int jmax = grid->getBlockSize(block); // iout << iINFO << "[" << CkMyPe() << "] grid block[" << i << "] " // << block << " size is " // << jmax << " offset " << outindex // << "\n" << endi; for(j=0; j < jmax; j++, outindex++) { const int idx = grid->getIndexForBlock(block,j); // CkPrintf("PVal %d Idx %d block %d boffset %d\n", // j1,idx,block,j); outmsg->gridVals[outindex].index = idx; outmsg->gridVals[outindex].val = grid->get_grid(idx); // iout << iINFO << "[" << CkMyPe() << "] Got grid value(" // << i << ")(" << outmsg->gridVals[i].index << ") " // << outmsg->gridVals[i].val // << "\n" << endi; } } } CProxy_ComputeGridForceNodeMgr me(thisgroup); me[msg->from_node].recvGridValues(outmsg); delete msg; }

void ComputeGridForceNodeMgr::receiveInitialGridData (  GridSegmentMsg *  msg  )

Definition at line 129 of file ComputeGridForce.C. References GridSegmentMsg::count, GridSegmentMsg::grid, GridSegmentMsg::gridnum, GridforceGrid::init4(), and GridSegmentMsg::start_index. { // iout << iINFO << "[" << CkMyPe() << "] Grid received " // << "\n" << endi; // iout << iINFO << "[" << CkMyPe() << "] Grid num=" << msg->gridnum // << " count=" << msg->count // << " start=" << msg->start_index // << "\n" << endi; grids[msg->gridnum]->init4(msg->grid,msg->start_index,msg->count); delete msg; CProxy_ComputeGridForceNodeMgr myproxy(thisgroup); myproxy[0].requestInitialGridData(); }

void ComputeGridForceNodeMgr::recvGridValues (  GridValuesMsg *  msg  )

Definition at line 318 of file ComputeGridForce.C. References GridforceGrid::addGridValue(), GridforceGrid::getGridBlockIdxOffset(), GridValuesMsg::gridStartIndex, GridValuesMsg::gridVals, GridVal::index, resume(), and GridVal::val. { // iout << iINFO << "[" << CkMyPe() << "] Receiving grid values" // << "\n" << endi; int gridnum; const int myrank = CkMyRank(); for (gridnum = 0; gridnum < num_grids; gridnum++) { GridforceGrid *grid = grids[gridnum]; int i; // CkPrintf("Unpacking from %d to %d\n", // msg->gridStartIndex[gridnum],msg->gridStartIndex[gridnum+1]); for(i=msg->gridStartIndex[gridnum]; i < msg->gridStartIndex[gridnum+1]; i++) { const int idx = msg->gridVals[i].index; int bi,boffset; grid->getGridBlockIdxOffset(idx,bi,boffset); // CkPrintf("UVal %d Idx %d block %d boffset %d\n", // i,idx,bi,boffset); grid->addGridValue(idx,msg->gridVals[i].val); /* iout << iINFO << "[" << CkMyPe() << "] Unpacking grid value(" */ /* << i << ")(" << msg->gridVals[i].index << ") " */ /* << grid->get_real_grid(msg->gridVals[i].index) */ /* << " --- " << msg->gridVals[i].val */ /* << "\n" << endi; */ /* */ } } msgSentCount--; // iout << iINFO << "[" << CkMyPe() << "] Done receiving grid values" // << " msgSentCount=" << msgSentCount // << "\n" << endi; if (msgSentCount == 0) { resume(); } delete msg; }

void ComputeGridForceNodeMgr::requestInitialGridData (   )

Definition at line 77 of file ComputeGridForce.C. References GridSegmentMsg::count, GridSegmentMsg::grid, GridSegmentMsg::gridnum, GridforceGrid::init3(), and GridSegmentMsg::start_index. { // iout << iINFO << "[" << CkMyPe() << "] Grids requested " // << requestGrids_count // << "\n" << endi; requestGrids_count++; // When all of the grids on a node have been deposited initially // a message will get sent here. After that, each call to // receiveInitialGridData on every node will generate another call // here until the data has all been sent if (requestGrids_count == CkNumNodes()) { requestGrids_count = 0; bool sent = false; while (!sent && cur_grid < num_grids) { GridSegmentMsg *msg = new GridSegmentMsg; msg->gridnum = cur_grid; grids[cur_grid]->init3(msg->grid,&(msg->start_index), &(msg->count)); if (msg->count > 0) { // CkPrintf("Msg is %p\n",msg); // iout << iINFO << "[" << CkMyPe() << "] Sending grid " // << msg->gridnum // << " of " << num_grids // << " start " << msg->start_index // << " count " << msg->count // << "\n" << endi; CProxy_ComputeGridForceNodeMgr myproxy(thisgroup); // iout << iINFO << "[" << CkMyPe() << "] got proxy" // << "\n" << endi; myproxy.receiveInitialGridData(msg); // iout << iINFO << "[" << CkMyPe() << "] sent data from grid " // << cur_grid // << "\n" << endi; sent = true; } else { // iout << iINFO << "[" << CkMyPe() << "] no data from grid " // << msg->gridnum // << "\n" << endi; cur_grid++; } } // if (!sent) { // iout << iINFO << "[" << CkMyPe() << "] Done sending grid data" // << "\n" << endi; // } } // iout << iINFO << "Done w/ request\n" << endi; }

void ComputeGridForceNodeMgr::resume (   )

Definition at line 374 of file ComputeGridForce.C. References ComputeGridForce::finishWork(). Referenced by recvGridValues(), and submitRequest(). { // Grid calculations should be cheap, so we won't bother parallelizing // them. As long as only one PE accesses the cache at a time, we don't // have to synchronize. Another option is to execute each finishWork() // on a separate PE, but then we have to make sure the GridCache is // thread-safe, or sequentialize access to it int rank; CProxy_ComputeGridForceMgr pemgr(CkpvAccess(BOCclass_group). computeGridForceMgr); for(rank=0; rank < nodeSize; rank++) { pemgr[CkNodeFirst(myNode) + rank].finishWork(); } }

void ComputeGridForceNodeMgr::submitRequest (  SubReqMsg *  msg  )

Definition at line 146 of file ComputeGridForce.C. References GridforceGrid::consolidateGridRequests(), GridRequestMsg::from_node, GridforceGrid::getGridIndices(), GridforceGrid::getNumGridRequests(), SubReqMsg::gf, GridRequestMsg::gridIndexList, GridRequestMsg::gridStartIndex, GridRequestMsg::num_grid_indices, SubReqMsg::rank, and resume(). { // CkPrintf("[%d] submitRequest received message %d from %d\n", // CkMyPe(),proc_count,msg->rank); const int msgrank = msg->rank; // Save the data from this request gf[msgrank] = msg->gf; delete msg; proc_count++; if (proc_count < nodeSize) { // iout << iINFO << "[" << CkMyPe() << "] " // << " submitRequest rank=" << msgrank // << " still waiting" // << "\n" << endi; return; } else proc_count = 0; // All requests received. Figure out what we actually need int i,rank; // CkPrintf("[%d] num_grids=%d nodeSize=%d\n", // CkMyPe(),num_grids,nodeSize); for(i=0; i < num_grids; i++) { grids[i]->consolidateGridRequests(); } // Package up grid element requests and send them off int num_indices = 0; for(i=0; i < num_grids; i++) { num_indices += grids[i]->getNumGridRequests(); } if (num_indices == 0) { // iout << iINFO << "[" << CkMyPe() << "] no vals needed " // << "\n" << endi; resume(); } else { // CkPrintf("[%d] requesting %d grid vals\n",CkMyPe(),num_indices); msgSentCount=0; int *gridStart = new int[num_grids+1]; int *gridIndices = new int[num_indices]; int *gridNodeList = new int[num_indices]; int *gridNodeCount = new int[CkNumNodes()]; GridforceGrid:: getGridIndices(gridStart,gridIndices,gridNodeList,gridNodeCount); GridRequestMsg **msgs = new GridRequestMsg*[CkNumNodes()]; int *cur_ind = new int[CkNumNodes()]; int i; for(i=0; i < CkNumNodes(); i++) { msgs[i] = new(num_grids+1,gridNodeCount[i]) GridRequestMsg; msgs[i]->from_node = myNode; msgs[i]->num_grid_indices = gridNodeCount[i]; cur_ind[i] = 0; } int grid; CProxy_ComputeGridForceNodeMgr me(thisgroup); for(grid=0; grid < num_grids; grid++) { for(i=0; i < CkNumNodes(); i++) msgs[i]->gridStartIndex[grid] = cur_ind[i]; for(i=gridStart[grid]; i < gridStart[grid+1]; i++) { int node = gridNodeList[i]; msgs[node]->gridIndexList[cur_ind[node]] = gridIndices[i]; cur_ind[node]++; } } for(i=0; i < CkNumNodes(); i++) msgs[i]->gridStartIndex[num_grids] = cur_ind[i]; for(i=0;i<CkNumNodes();i++) { if (gridNodeCount[i] > 0) { // iout << iINFO << "[" << CkMyPe() << "] fetching from " << i // << "\n" << endi; me[i].fetchGridValues(msgs[i]); msgSentCount++; } else { delete msgs[i]; } } delete [] cur_ind; delete [] msgs; delete [] gridNodeCount; delete [] gridNodeList; delete [] gridIndices; delete [] gridStart; } // iout << iINFO << "[" << CkMyPe() << "] " // << "submitRequest DONE rank=" << msgrank // << "\n" << endi; }

---

The documentation for this class was generated from the following files:

• ComputeGridForce.h
• ComputeGridForce.C

---