Slide 99
Slide 99 text
Each Event:
Objective:
Constraints:
Problem Formulation
27
▸ 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 (j) }
△Texe (i) =Tmemory
+∑ * ⍺ (i, j)
Pmap (i) = Freq2Power (j) * ⍺ (i, j)
∑
1
=
⍺ (i, j)
With the constraints: ∑