This covers Chapter $8$ and real$-$time scheduling from Chapter $7.$

Chapter $7$ Problems

Problem $1.$ Consider the following two threads, $\backslash ($ A $\backslash )$ and $\backslash ($ B $\backslash ),$ that start at the same time $0.$ Also, each task must be completed within its period.

The following is a Gantt chart for a schedule if only thread A runs

The following is a Gantt chart for a schedule if only thread B runs

The next two parts are assuming both A and B run.

$($a$)[1$ pt$]$ Consider the scheduling using rate$-$monotonic scheduling. Fill in the following Gantt chart for the schedule.

$($b$)[1$ pt$]$ Consider the scheduling using earliest deadline first scheduling $($which is preemptive$).$ Fill in the following Gantt chart for the schedule.

WHEN FILLING IN THE SLOTS, ITS EITHER A OR B $($NOT A NUMBER$)!!!!!!!!!!!!!!!!!!!!!$