
4.2 Real-Time Process Scheduling 229
dynamic and
priority-driven
scheduling
Dynamic scheduling algorithms for periodic sets of processes are often cast
as priority-driven scheduling. A priority-driven scheduler assigns priorities to
each process. It then takes the process with the highest priority as the next pro-
cess to run.
Figure 4-4 The interval-scheduling algorithm. From Chou and Borriello [Cho95a] © 1995
ACM Press.
Wolf.book Page 229 Tuesday, August 8, 2006 1:56 PM