Question 3.37

7. Use the list-processing algorithm to schedule the tasks in the accompanying order-requirement digraph on

image
  1. two processors using the list T1, …, T7.
  2. two processors using the list T1, T2, T3, T4, T6, T5, T7.
  3. Is either of the schedules that you obtain optimal?
  4. Will adding a third processor enable the tasks to be finished earlier?
  5. Which tasks in this order-requirement digraph can be shortened and not affect the completion time of all the tasks?

7.

(a) Processor 1: ; Processor 2: Idle 0 to 2, , idle 4 to 5

(b) Processor 1: ; Processor 2: Idle 0 to 2, T4, T5, idle 4 to 5

(c) Yes

(d) No

(e) T3 and T5