Slide 167
Slide 167 text
Each Event:
Objective:
Constraints:
Problem Formulation
50
▸ Scheduling Problem → Constrained Optimization.
N
∑
i
△Texe (i) x Pmap (i)
Min.
Order: ≤
Tend (i) Tstart (i+1)
Deadline: ≤
Tstart (i) △Texe (i) TQoS (i)
+
{ Ncycles / f (i, j) }
△Texe (i) =Tmemory
+M
∑
j=0
* ⍺ (i, j) ⍺ (i, j) in {0,1}
Pmap (i) = Freq2Power ( f(i, j) ) * ⍺ (i, j)
M
∑
j=0
1
=
⍺ (i, j)
With the constraint:
M
∑
j=0