APERIODIC TASK SCHEDULING - Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications - page 78

3.5 Given seven tasks, A , B , C , D , E , F , and G , construct the precedence graph

from the following precedence relations:

A → C

B → CB → D

C → EC → F

D → FD → G

Then, assuming that all tasks arrive at time t =0, have deadline D = 25, and
computation times 2, 3, 3, 5, 1, 2, 5, respectively, modify their arrival times
and deadlines to schedule them by EDF.