Real-Time Programming Languages - Operating Systems
Real-Time Programming Languages - Operating Systems Real-Time Programming Languages - Operating Systems
EDF and Ceiling ● Implements “Preemption Level Control Protocol” look forward to: lecture on resource access control separates: ● ● Urgency (EDF) Preemption level ● Using Priority Ceiling of Protected Objects as Preemption Level Burns, ● Details: see Ted Baker(91) and Wellings (complicated) WS 2013/14 Real-Time Systems, Real-Time Prog. Languages / Hermann Härtig 38
Mixed Scheduling Policies, example Specify “priority partitions” to set scheduling disciplines Burns, Wellings Ch. 14.4 Page 347 01 02 03 04 05 06 07 08 09 10 Pragma Priority_Specific_Dispatching (Fifo_Within_Priorities, 10, 16) Pragma Priority_Specific_Dispatching (EDF_Across_Priorities, 2,9) Pragma Priority_Specific_Dispatching (RoundRobin_Within_Priorities, 1, 1) WS 2013/14 Real-Time Systems, Real-Time Prog. Languages / Hermann Härtig 39
- Page 1 and 2: Real-Time Systems Hermann Härtig R
- Page 3 and 4: RT Language Classes Synchronous HLL
- Page 5 and 6: Synchronous Systems → Synchronous
- Page 7 and 8: Esterel at a glance Most statements
- Page 9 and 10: Esterel „Data“: Variables and S
- Page 11 and 12: Signals vs Variables 01 Emit Count(
- Page 13 and 14: Examples (all by Berry): ABRO Speci
- Page 15 and 16: Speed Specification SPEED: Count th
- Page 17 and 18: Few general points Ada has “Annex
- Page 19 and 20: Concurrency Tasks ● ● ● ● a
- Page 21 and 22: Termination of Tasks Every task has
- Page 23 and 24: The Rendezvous Based on client/serv
- Page 25 and 26: In detail task executing Server Cli
- Page 27 and 28: Select Statement ● ● Arbitrary
- Page 29 and 30: Example: Resource with Locking 01 0
- Page 31 and 32: Tasks ./. Protected Objects 01 02 0
- Page 33 and 34: Fixed Priorities ● task (type) T
- Page 35 and 36: Active Priority Base priority or
- Page 37: EDF Dispatching How to set deadline
- Page 41 and 42: Explicit Request Ordering: Requeue
- Page 43 and 44: Timing events 01 02 03 04 05 06 07
- Page 45 and 46: Example: Watchdog 01 02 03 04 05 06
- Page 47 and 48: Time: Delay Statement 01 02 03 04 0
- Page 49 and 50: Delay and Select, client side(1) 01
- Page 51 and 52: Example 01 02 03 04 05 06 07 select
- Page 53 and 54: Example: Operator/Subscriber 01 02
- Page 55 and 56: Example: Operator/Subscriber 01 02
- Page 57 and 58: Recurrent Tasks (1) 01 02 03 04 05
- Page 59 and 60: Recurrent Tasks (3) Periodic tasks
- Page 61 and 62: Example 01 02 03 04 05 06 07 08 09
- Page 63 and 64: Example 01 02 03 04 05 06 07 08 09
- Page 65 and 66: Missing in this RT-HLL lecture ●
EDF and Ceiling<br />
●<br />
Implements “Preemption Level Control Protocol”<br />
look forward to: lecture on resource access control<br />
separates:<br />
●<br />
●<br />
Urgency (EDF)<br />
Preemption level<br />
●<br />
Using Priority Ceiling of Protected Objects as<br />
Preemption Level<br />
Burns,<br />
● Details: see Ted Baker(91) and Wellings (complicated)<br />
WS 2013/14 <strong>Real</strong>-<strong>Time</strong> <strong>Systems</strong>, <strong>Real</strong>-<strong>Time</strong> Prog. <strong>Languages</strong> / Hermann Härtig 38
Change language