Consider a set of three periodic tasks with the execution profiles of Table 10.7. Develop scheduling diagrams similar to those of Figure 10.5 for this set of tasks.

Table 10.7

Figure 10.5

Table 10.7 Execution Profile for Problem 10.1 Process Arrival Time Execution Time Ending Deadline A(1) 0 10 20 A(2) 20 10 40 B(1) 0 10 50 B(2) 50 10 100 . C(1) 0 15 50 C(2) 50 15 100 . B1 deadline A2 A3 deadline deadline B2 deadline AS deadline keaaline A1 deadline deadline keadline deadline A4 deadline AI A2 A3 Arrival times, execution times, and deadlines BI 10 20 30 Time (ms) 0 1 1 1 1 i 1 40 1 1 1 A4 AS B2 1 60 70 80 100 1 1 1 1 1 1 1 1 1 B2 A4 B2 AS B2 1 1 1 1 1 1 BI A2 BI Fixed-priority scheduling; A has priority A3 AL A2 BI A3 i (missed) A4 1 AS, B2 1 1 1 1 1 B1 A2 A3 B2 AS Fixed-priority scheduling: B has priority 42 BL 43 AS! B2 A4 (missed) 1 1 i (missed) 1 1 1 1 BI A2 BII A3 B2 A4 B2 AS Earliest-deadline scheduling using completion deadlines i 1 A2 BI A3 A4 AS, B2 Figure 10.5 Scheduling of Periodic Real-Time Tasks with Completion Deadlines (Based on Table 10.30)