Problem of the Module (POM) 3

2) Consider the order-requirement digraph below (with the time required for each task given in minutes inside the respective node). a) Use the list processing algorithm with the above order-requirement digraph and the priority list {T1, T2, T3, T4, T5, T6} to schedule the six tasks on two processors. b) Apply critical-path scheduling to obtain the priority list for the six tasks. c) Use the list-processing algorithm with the above order-requirement digraph and the priority list you constructed in part b to schedule the six tasks on two processors. d) Is either of the schedules you found (in part a or c) optimal? How do you know?

2) Consider the order-requirement digraph below (with the time required for each task given in minutes inside the respective node).

a) Use the list processing algorithm with the above order-requirement digraph and the priority list {T₁, T₂, T₃, T₄, T₅, T₆} to schedule the six tasks on two processors.

b) Apply critical-path scheduling to obtain the priority list for the six tasks.

c) Use the list-processing algorithm with the above order-requirement digraph and the priority list you constructed in part b to schedule the six tasks on two processors.

d) Is either of the schedules you found (in part a or c) optimal? How do you know?

a) Use the list processing algorithm with the above order-requirement digraph and the priority list {T₁, T₂, T₃, T₄, T₅, T₆} to schedule the six tasks on two processors.

b) Apply critical-path scheduling to obtain the priority list for the six tasks.

c) Use the list-processing algorithm with the above order-requirement digraph and the priority list you constructed in part b to schedule the six task