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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
#ifndef LP_COMMON_H_
#define LP_COMMON_H_
#include <stdint.h>
#include "sharedres_types.h"
#include "blocking.h"
#include "stl-helper.h"
#include "stl-hashmap.h"
#include "linprog/model.h"
#include "linprog/solver.h"
enum blocking_type
{
BLOCKING_DIRECT,
BLOCKING_INDIRECT,
BLOCKING_PREEMPT
};
class VarMapper {
private:
hashmap<uint64_t, unsigned int> map;
unsigned int next_var;
bool sealed;
void insert(uint64_t key)
{
assert(next_var < UINT_MAX);
assert(!sealed);
unsigned int idx = next_var++;
map[key] = idx;
}
static uint64_t encode_request(uint64_t task_id, uint64_t res_id, uint64_t req_id,
uint64_t blocking_type)
{
assert(task_id < (1 << 30));
assert(res_id < (1 << 10));
assert(req_id < (1 << 22));
assert(blocking_type < (1 << 2));
return (blocking_type << 62) | (task_id << 30) | (req_id << 10) | res_id;
}
public:
VarMapper(unsigned int start_var = 0)
: next_var(start_var), sealed(false)
{}
unsigned int lookup(unsigned int task_id, unsigned int res_id, unsigned int req_id,
blocking_type type)
{
uint64_t key = encode_request(task_id, res_id, req_id, type);
if (!map.count(key))
insert(key);
return map[key];
}
// stop new IDs from being generated
void seal()
{
sealed = true;
}
void clear()
{
map.clear();
}
unsigned int get_num_vars() const
{
return map.size();
}
unsigned int get_next_var() const
{
return next_var;
}
};
void set_blocking_objective(
VarMapper& vars,
const ResourceSharingInfo& info, const ResourceLocality&,
const TaskInfo& ti,
LinearProgram& lp,
LinearExpression *local_obj = 0,
LinearExpression *remote_obj = 0);
void set_blocking_objective_part_shm(
VarMapper& vars,
const ResourceSharingInfo& info,
const TaskInfo& ti,
LinearProgram& lp,
LinearExpression *local_obj = 0,
LinearExpression *remote_obj = 0);
void add_mutex_constraints(VarMapper& vars,
const ResourceSharingInfo& info,
const TaskInfo& ti, LinearProgram& lp);
void add_topology_constraints(VarMapper& vars,
const ResourceSharingInfo& info, const ResourceLocality& locality,
const TaskInfo& ti, LinearProgram& lp);
void add_local_lower_priority_constraints(
VarMapper& vars,
const ResourceSharingInfo& info,
const ResourceLocality& locality,
const TaskInfo& ti,
LinearProgram& lp);
void add_topology_constraints_shm(
VarMapper& vars,
const ResourceSharingInfo& info,
const TaskInfo& ti,
LinearProgram& lp);
void add_local_lower_priority_constraints_shm(
VarMapper& vars,
const ResourceSharingInfo& info,
const TaskInfo& ti,
LinearProgram& lp);
void add_local_higher_priority_constraints_shm(
VarMapper& vars,
const ResourceSharingInfo& info,
const TaskInfo& ti,
LinearProgram& lp);
// A generic for loop that iterates 'request_index_variable' from 0 to the
// maximum number of requests issued by task tx while ti is pending. 'tx_request'
// should be of type RequestBound&.
#define foreach_request_instance(tx_request, task_ti, request_index_variable) \
for ( \
unsigned int __max_num_requests = (tx_request).get_max_num_requests((task_ti).get_response()), \
request_index_variable = 0; \
request_index_variable < __max_num_requests; \
request_index_variable++ \
)
// iterate over each task using 'task_iter', skipping 'excluded_task'
#define foreach_task_except(tasks, excluded_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_id() != (excluded_task).get_id())
// iterate only over tasks with equal or lower priority
#define foreach_lowereq_priority_task(tasks, reference_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_priority() >= (reference_task).get_priority())
// iterate only over tasks with equal or lower priority, excluding 'reference_task'
#define foreach_lowereq_priority_task_except(tasks, reference_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_priority() >= (reference_task).get_priority() && \
task_iter->get_id() != (reference_task).get_id())
// iterate only over tasks with higher priority
#define foreach_higher_priority_task(tasks, reference_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_priority() < (reference_task).get_priority())
// iterate over requests not in the local cluster
#define foreach_remote_request(requests, locality, task_ti, request_iter) \
foreach(requests, request_iter) \
if ((locality)[request_iter->get_resource_id()] \
!= (int) (task_ti).get_cluster())
// iterate over requests for resources in a specific cluster
#define foreach_request_in_cluster(requests, locality, cluster, request_iter) \
foreach(requests, request_iter) \
if ((locality)[request_iter->get_resource_id()] \
== (int) (cluster))
// iterate over each task using 'task_iter', skipping tasks in the same
// cluster as 'local_task'
#define foreach_remote_task(tasks, local_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_cluster() != (local_task).get_cluster())
// iterate only over tasks with equal or lower priority, excluding local tasks
#define foreach_remote_lowereq_priority_task(tasks, reference_task, task_iter) \
foreach_remote_task(tasks, reference_task, task_iter) \
if (task_iter->get_priority() >= (reference_task).get_priority())
// iterate only over tasks with higher priority, excluding local tasks
#define foreach_remote_higher_priority_task(tasks, reference_task, task_iter) \
foreach_remote_task(tasks, reference_task, task_iter) \
if (task_iter->get_priority() < (reference_task).get_priority())
#define foreach_local_task(tasks, local_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_cluster() == (local_task).get_cluster())
#define foreach_local_task_except(tasks, local_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_cluster() == (local_task).get_cluster() && \
task_iter->get_id() != (local_task).get_id())
#define foreach_local_lowereq_priority_task_except(tasks, local_task, task_iter) \
foreach(tasks, task_iter) \
if (task_iter->get_cluster() == (local_task).get_cluster() && \
task_iter->get_id() != (local_task).get_id() && \
task_iter->get_priority() >= (local_task).get_priority())
#define foreach_request_for(requests, res_id, req_iter) \
foreach(requests, req_iter) \
if (req_iter->get_resource_id() == res_id)
#endif /* LP_COMMON_H_ */
|
