-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathrandom.yaml
240 lines (228 loc) · 5.89 KB
/
random.yaml
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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
---
# Example Application File for Drachma
name: Random Application (a made-up application)
# Internal Configuration Access Port (ICAP)
ICAP:
# The speed (in MHz) of the ICAP (required).
speed: 100.00
# The number of bits the ICAP can transfer per clock cycle (required).
width: 32
# Partial Reconfiguration Controller (PRC)
PRC:
# The speed (in MHz) of the PRC (required).
speed: 100.00
# [TODO] task scheduling:
# - fcfs (first come first serve)
# * no jobs: schedule first
# * jobs going
# - sjn (shortest job next): naive
# * no jobs: schedule first
# * 4 jobs, 2 in contention
# - sjn (shortest job next): schedule contentious first
# * no jobs: schedule first
# * 4 jobs, 2 in contention
# - priority - requires that metadata has priortiy within them.
#
# - rr (round-robin) - doesn't make sense since this is for scheduling tasks on a single core; without preemption this wont work.
# - "Weighted shortest job first" (WSJF) - too complicated of a scheduling algorithm to implement; jobs get weighted with the cost of delay so that the highest valued jobs get done sooner.
# - shortest remaining time first (SRTF) - cant be done because it requires preemption
task scheduling: fcfs
# [TODO] rr selection policy:
# - lft Least Flexible, Task (RR) + Fastest Execution (bitstream):
# Choose the RR that can support the least unique tasks leaving the more flexible RR free.
# If more than one bitstream implements the desired task the fastest design will be chosen.
# * what about selection policies that take into account cache? a lower cost than pulling fresh is pulling from cache
# * what about a task that can be done by two different implementations (2 diff bitstreams)
rr selection policy: lft
# Static Regions (SRs)
# The speed (in MHz) of the SRs (required if declaring SRs).
static region speed: 100.00
SRs:
- id: 0
module count: 2
- id: 1
module count: 1
# Amount of modules residing in a SR.
#sr0 module count: 2
#sr1 module count: 1
# Reconfigurable Regions (RRs)
RRs:
# RR 0
- id: 0
# Amount of bytes required from the ICAP to reconfigure the RRs.
bitstream size: 64 # 1024
# All module bitstreams designed to be installed into this RR.
modules:
# RR 0, Module 0
- id: 0
# Which tasks does this module's design implement.
tasks:
# Classification of task performed.
- type: 0
# Speed at which design supports this task type.
speed: 100.00
# Cycles required to complete this task.
cycles: 10
- type: 1
speed: 100.00
cycles: 10
# RR 0, Module 1
- id: 1
tasks:
- type: 1
speed: 100.00
cycles: 10
- type: 2
speed: 100.00
cycles: 10
# RR 0, Module 2
- id: 2
tasks:
- type: 1
speed: 100.00
cycles: 10
- type: 2
speed: 100.00
cycles: 10
- type: 3
speed: 100.00
cycles: 10
# RR 0, Module 3
- id: 3
tasks:
- type: 4
speed: 100.00
cycles: 10
- type: 5
speed: 100.00
cycles: 10
# RR 0, Module 4
- id: 4
tasks:
- type: 1
speed: 100.00
cycles: 10
- type: 2
speed: 100.00
cycles: 10
- type: 4
speed: 100.00
cycles: 10
# RR 1
- id: 1
bitstream size: 32 # 768
modules:
# RR 1, Module 0
- id: 0
tasks:
- type: 6
speed: 100.00
cycles: 10
- type: 7
speed: 100.00
cycles: 10
# RR 1, Module 1
- id: 1
tasks:
- type: 8
speed: 100.00
cycles: 10
- type: 9
speed: 100.00
cycles: 10
# RR 1, Module 2
- id: 2
tasks:
- type: 6
speed: 100.00
cycles: 10
- type: 7
speed: 100.00
cycles: 10
- type: 8
speed: 100.00
cycles: 10
# RR 1, Module 3
- id: 3
tasks:
- type: 7
speed: 100.00
cycles: 10
- type: 8
speed: 100.00
cycles: 10
# RR 2
- id: 2
bitstream size: 16 # 512
modules:
# RR 2, Module 0
- id: 0
tasks:
- type: 9
speed: 100.00
cycles: 10
- type: 10
speed: 100.00
cycles: 10
# RR 2, Module 1
- id: 1
tasks:
- type: 10
speed: 100.00
cycles: 10
- type: 11
speed: 100.00
cycles: 10
# RR 2, Module 2
- id: 2
tasks:
- type: 9
speed: 100.00
cycles: 10
- type: 11
speed: 100.00
cycles: 10
# RR 3
- id: 3
bitstream size: 8 # 256
modules:
# RR 3, Module 0
- id: 0
tasks:
- type: 11
speed: 100.00
cycles: 10
- type: 12
speed: 100.00
cycles: 10
# RR 3, Module 1
- id: 1
tasks:
- type: 11
speed: 100.00
cycles: 10
- type: 13
speed: 100.00
cycles: 10
# RR 4
- id: 4
bitstream size: 8 # 256
modules:
# RR 4, Module 0
- id: 0
tasks:
- type: 13
speed: 100.00
cycles: 10
- type: 14
speed: 100.00
cycles: 10
# RR 4, Module 1
- id: 1
tasks:
- type: 11
speed: 100.00
cycles: 10
- type: 14
speed: 100.00
cycles: 10