-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathscheduler.cpp
More file actions
47 lines (44 loc) · 1.02 KB
/
scheduler.cpp
File metadata and controls
47 lines (44 loc) · 1.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include "task.h"
std::vector<JobTuple> Scheduler::newEvent(
const std::vector<ResourceTuple>& resources,
const std::vector<JobTuple>& jobs)
{
for (const auto& r: resources)
nodeResources[r.nodeId] += r.resources;
for (const auto& j: jobs)
sortedJobs.insert(j);
return schedule();
}
std::vector<JobTuple> Scheduler::schedule()
{
std::vector<JobTuple> scheduled;
for (const JobTuple& j : sortedJobs)
{
int node = findNode(j.resources);
if (node >= 0)
{
nodeResources[node] -= j.resources;
scheduled.push_back(j);
}
}
for (const JobTuple& j : scheduled)
sortedJobs.erase(j);
return scheduled;
}
int Scheduler::findNode(int resources) // returns -1 on empty result (not found)
{
int node = -1;
int delta = 0;
for (const auto& nr : nodeResources)
{
int nrNode = nr.first;
int nrResources = nr.second;
int nrDelta = nrResources - resources;
if (nrDelta >= 0 && (node == -1 || delta > nrDelta))
{
delta = nrDelta;
node = nrNode;
}
}
return node;
}