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

More documents

Recommendations

Info

ExampleConsider a system of four tasks, T 1 = (4, 1), T 2 = (5, 1.8),T 3 = (20, 1), T 4 = (20, 2)By first constraint, f ≥ 2.Hyperperiod is 20, so by second constraint, possible choicesfor f are 2, 4, 5, 10, and 20.Only f = 2 satisfies the third constraint. The following is apossible cyclic schedule:
Job SlicesWhat do we do if the frame size constraints cannot be met?Example: Consider T = {(4, 1), (5, 2, 7), (20, 5)}. By first constraint,f ≥ 5, but by third constraint, f ≤ 4!Solution: “Slice” the task (20, 5) into subtasks, (20, 1), (20, 3), and(20, 1). Then, f = 4 works. Here’s a schedule:
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: Frame Constraints (Cont.)We want th
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 32 and 33: Illustration of Flow Graph
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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?