|| || || || || || || ||

---

JobManager.h

Go to the documentation of this file.

#ifndef Impala_Util_Mpi_JobManager_h
#define Impala_Util_Mpi_JobManager_h

#include <map>
#include "Util/PropertySet.h"

//grrrrr, klote windows defines....
#ifdef GetJob
#undef GetJob
#endif

namespace Impala
{
namespace Util
{
namespace Mpi
{


class JobGroup
{
public:
    JobGroup(std::string groupProperties, std::string groupId, int jobCount) :
        mGroupProperties(groupProperties)
    {
        mJobs = jobCount;
        mNextJob = 0;
        mGroupId = groupId;
        mWorkers = 0;
    }

    void JobDone(PropertySet* job)
    {
        if(job->GetString("JobManager::group-id") != mGroupId)
            return;
        --mWorkers;
    }

    bool GetJob(PropertySet* job)
    {
        if(mNextJob < mJobs)
        {
            Append(job, &mGroupProperties);
            job->Add("JobManager::group-id", mGroupId);
            job->Add("JobManager::job-id", mNextJob);
            ++mNextJob;
            ++mWorkers;
            return true;
        }

        // all jobs done, we could give a new job
        return false;
    }
    
    int OpenJobs()
    {
        return mJobs - mNextJob;
    }

private:
    PropertySet mGroupProperties;
    int mJobs;
    int mNextJob;
    std::string mGroupId;
    int mWorkers;
};


class JobManager
{
public:
    JobManager()
    {
    }

    virtual ~JobManager()
    {
        std::map<std::string, JobGroup*>::iterator it;
        for(it=mGroups.begin() ; it!=mGroups.end() ; ++it)
            delete it->second;
    }

    void CreateGroup(std::string groupProperties, std::string groupId, int jobCount)
    {
        mGroups[groupId] = new JobGroup(groupProperties, groupId, jobCount);
    }

    void GetJob(PropertySet* job)
    {
        std::string lastgroup = job->GetString("JobManager::group-id");
        if(lastgroup != "")
        {
            mGroups[lastgroup]->JobDone(job);
            if(mGroups[lastgroup]->GetJob(job))
                return;
        }
        //if the previous group is done, or this is the first job, find the group with the least workers
        std::map<std::string, JobGroup*>::iterator it = mGroups.begin();
        JobGroup* current = it->second;
        JobGroup* best = current;
        int todo = current->OpenJobs();
        while(it!=mGroups.end())
        {
            current = it->second;
            if(current->OpenJobs() > todo)
            {
                todo = current->OpenJobs();
                best = current;
            }
            ++it;
        }
        if(best->GetJob(job))
            return;

        // all groups done, no more jobs to give
        job->Add("JobManager::group-id", "");
        job->Add("JobManager::job-id", "-1");
    }

private:
    std::map<std::string, JobGroup*> mGroups;
};


}//namespace Mpi
}//namespace Util
}//namespace Impala

#endif Impala_Util_Mpi_JobManager_h

---