void TempAwareGreedyLB::work(LDStats* stats)
{
CkPrintf("----------------- in TempAwareGreedyLB -----------\n");
/** ========================== INITIALIZATION ============================= */
ProcArray *parr = new ProcArray(stats); // Processor Array
ObjGraph *ogr = new ObjGraph(stats); // Object Graph
/** ============================= STRATEGY ================================ */
parr->resetTotalLoad();
if (_lb_args.debug()>1)
CkPrintf("[%d] In TempAwareGreedyLB strategy\n",CkMyPe());
int vert;
// max heap of objects
std::sort(ogr->vertices.begin(), ogr->vertices.end(), ObjLoadGreater());
// min heap of processors
std::make_heap(parr->procs.begin(), parr->procs.end(), ProcLoadGreater());
for(vert = 0; vert < ogr->vertices.size(); vert++) {
// Pop the least loaded processor
ProcInfo p = parr->procs.front();
std::pop_heap(parr->procs.begin(), parr->procs.end(), ProcLoadGreater());
parr->procs.pop_back();
// Increment the load of the least loaded processor by the load of the
// 'heaviest' unmapped object
p.setTotalLoad(p.getTotalLoad() + ogr->vertices[vert].getVertexLoad());
ogr->vertices[vert].setNewPe(p.getProcId());
// Insert the least loaded processor with load updated back into the heap
parr->procs.push_back(p);
std::push_heap(parr->procs.begin(), parr->procs.end(), ProcLoadGreater());
}
/** ============================== CLEANUP ================================ */
ogr->convertDecisions(stats); // Send decisions back to LDStats
}
bool operator()(ProcInfo p1, ProcInfo p2) {
return (p1.getTotalLoad() > p2.getTotalLoad());
}
