Figure 3.9:
Figure 3.9
The schedule produced by applying the list-processing algorithm to the order-requirement digraph in
Figure 3.4
, modified by erasing all its directed edges, using the list
T
1
,
T
2
, …,
T
9
with three processors.
