
306 EMBEDDED SYSTEMS
Note that the release times of the tasks T
2
and T
3
are marked at t = 1 and 3,
respectively. is task set is, therefore, schedulable.
Note: ere is also a ‘necessary’ condition for verifying if a task set is schedulable by the
RM algorithm. Since it involves a lot of calculation, it hasn’t been included here. For
now, we will be satisfi ed with the necessary condition, and one thing that might strike
us is that as the number of tasks increases, the CPU utilization has to reduce (Table8.2)
to ensure that it is ‘schedulable’ using the RM algorithm. is is ineffi cient, because
maximizing CPU utilization is one of the aims ...