OpenAtom
Version1.5a
|
Public Member Functions | |
RhoGSMapTable (MapType2 *_map, PeList *_availprocs, int _nchareRhoG, bool useCentroid, MapType2 *rhorsmap, PeList *exclude) | |
RhoG and RhoR are mutually all to all. More... | |
Public Member Functions inherited from MapTable2 | |
void | dump () |
Public Attributes | |
int | nchareRhoG |
Public Attributes inherited from MapTable2 | |
MapType2 * | maptable |
PeList * | availprocs |
Additional Inherited Members | |
Protected Member Functions inherited from MapTable2 | |
void | makeReverseMap () |
CkVec< intdual > | ProcByArrIndex (int proc) |
return ckvec containing the reverse map of all elements on given proc | |
int | getCentroid (int torusMap) |
return processor at topological center of this list | |
Protected Attributes inherited from MapTable2 | |
CkVec< intdual > * | reverseMap |
Definition at line 437 of file MapTable.h.
RhoGSMapTable::RhoGSMapTable | ( | MapType2 * | _map, |
PeList * | _availprocs, | ||
int | _nchareRhoG, | ||
bool | useCentroid, | ||
MapType2 * | rhorsmap, | ||
PeList * | exclude | ||
) |
RhoG and RhoR are mutually all to all.
They should be mapped such that they are relatively near but exclusive. Meaning they should share no processors if there are enough to go around. Given that RhoR is already placed. We can take the centroid of that map. Then sort the available list based on distance to that centroid. Giving us the cloud of available processors around the RhoRS processors as our preferred placement.
Definition at line 1922 of file MapTable.C.
References RhoGSMapTable().
Referenced by RhoGSMapTable().