-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnotes.txt
More file actions
33 lines (23 loc) · 858 Bytes
/
notes.txt
File metadata and controls
33 lines (23 loc) · 858 Bytes
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
two-level priorities
global, fixed
per-unit work
load
load_priority
last_served
unmet_demand[time t]: work (power, time), deadline, load_priority, class (urgent or best effort)
allocated[time t]: watts (extends into future)
supply
supply[time t]: watts
allocation:
allocated[time t]: load i, watts
algorithm:
allocate all the important work in order of decreasing load priority
for loads with multiple levels of operation, allocate lowest level, then iterate at end
allocate all of the best effort work in order of decreasing load priority
???: how to incorporate prediction?
status
DO_NOT_DEFER = 0 (hard deadline imminent)
DEFER_LAST = 1 (soft deadline imminent)
DEFER_FIRST = 2 (no deadline imminent)
list of loads sorted by class, then priority
remove from list if fully satisfied, otherwise flag that can be moved up a level