blob: a152c39bc076f8f89441dd23f7b34697769f6af2 (
plain)
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
#pragma once
#include "Scheduler.h"
#include <algorithm>
namespace Simulation
{
class ShortestRemainingTimeScheduler : public Scheduler
{
protected:
~ShortestRemainingTimeScheduler()
{
}
public:
/**
* \brief Distribute workloads according to the srtf principle.
*/
void schedule(std::vector<std::reference_wrapper<Modeling::Machine>>& machines, std::vector<Workload*> workloads) override
{
if (workloads.size() == 0)
return;
std::remove_if(workloads.begin(), workloads.end(), [](Workload* workload) {
return !workload->dependencyFinished;
});
for (auto workload : workloads)
{
workload->setCoresUsed(0);
}
std::sort(
workloads.begin(),
workloads.end(),
[](Workload* a, Workload* b) -> bool {
return a->getRemainingOperations() < b->getRemainingOperations();
}
);
int taskIndex = 0;
for (auto machine : machines)
{
machine.get().giveTask(workloads.at(taskIndex));
workloads.at(taskIndex)->setCoresUsed(
workloads.at(taskIndex)->getCoresUsed() + machine.get().getNumberOfCores()
);
if (!workloads.at(taskIndex)->isParallelizable())
{
workloads.erase(workloads.begin() + taskIndex);
if (workloads.size() == 0)
break;
taskIndex %= workloads.size();
}
else
{
taskIndex = (++taskIndex) % workloads.size();
}
}
}
};
}
|
