PERIODIC TASK SCHEDULING - Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications - page 118

4.2 Verify the schedulability and construct the schedule according to the RM algo-

rithm for the following set of periodic tasks:

C i T i

τ 1 3 5

τ 2 1 8

τ 3 1 10

4.3 Verify the schedulability and construct the schedule according to the RM algo-

rithm for the following set of periodic tasks:

C i T i

τ 1 1 4

τ 2 2 6

τ 3 3 10

4.4 Verify the schedulability under RM of the following task set:

C i T i

τ 1 1 4

τ 2 2 6

τ 3 3 8

4.5 Verify the schedulability under EDF of the task set shown in Exercise 4.4, and

then construct the corresponding schedule.

4.6 Verify the schedulability under EDF and construct the schedule of the following

task set:

C i D i T i

τ 1 2 5 6

τ 2 2 4 8

τ 3 4 8 12

4.7 Verify the schedulability of the task set described in Exercise 4.6 using the

Deadline-Monotonic algorithm. Then construct the schedule.