1
Q
Deadline Monotonic
A
- shortest deadline has the highest priority
- ## D = T => Rate Monotonic is optimal
2
Q
EDF, Earliest Deadline First Scheduling
A
Configuration
- none, all scheduling desicions are made online
- task priority given by its relative deadline
- the task with the shortest deadline left executes first
Assumption similar to RM
- indipendent tasks
- deadline = period
- releasetime = start of period
Schedulability Condition
- IF D= T => U<=1
- IF D<T => Processor utilisation demand analysis
3
Q
Offline Scheduling
A
- created before system run-time
- can be pre-emptive or non-pre-emptive
- “ned-to-end” communication described by precedence graph
- non periodic events taken care of by periodic tasks
