Clock-driven (or Static) Scheduling (Baker and Shaw and Chapter 5 ...

More documents

Recommendations

Info

Illustration of Flow Graph
Finding a ScheduleThe maximum attainable flow value is clearly∑ i=1,…,N e i . This corresponds to the exact amount ofcomputation to be scheduled in the major cycle.If a max flow is found with value ∑ i=1,…,N e i , thenwe have a schedule.If a job is scheduled across multiple frames, thenwe must slice it into corresponding subjobs.
Page 3: Classification of Scheduling Algori
Page 7 and 8: Static, Timer-driven Scheduling
Page 9 and 10: FramesLet us refine this notion of
Page 11 and 12: Frame Constraints (Cont.)We want th
Page 13 and 14: Job SlicesWhat do we do if the fram
Page 15 and 16: Pseudo-code for Cyclic Executive
Page 17 and 18: Slack StealingLet the total amount
Page 19 and 20: Implementing Slack StealingUse a pr
Page 21 and 22: Acceptance TestLet σ (i, k) be the
Page 23 and 24: Executing Sporadic TasksAccepted sp
Page 25 and 26: S 1 is released at time 3.» Must b
Page 27 and 28: Pseudo-code for Mode Changertask MO
Page 30 and 31: Network Flow Algorithm (INF) forCom
Page 34 and 35: Example
Page 36 and 37: Example
Page 38 and 39: Pros and Cons of Cyclic ExecutivesM
Page 40 and 41: Pros and Cons (Continued)Disadvanta

Clock-driven (or Static) Scheduling (Baker and Shaw and Chapter 5 ...

Create successful ePaper yourself

Delete template?

Save as template?