Question 3.49

19. For the accompanying order-requirement digraph, apply the list-processing algorithm, using three processors for lists (a) through (c). How do the completion times obtained compare with the length of the critical path?

image
  1. T1, T2, T3, T4, T5, T6, T7, T8
  2. T1, T3, T5, T7, T2, T4, T6, T8
  3. T8, T6, T4, T2, T1, T3, T5, T7

19.

(a) Processor 1: , idle 15 to 21, T7, idle 27 to 31; Processor 2: ; Processor 3: , idle from 13 to 31

(b) Processor 1: , idle 15 to 21, T7, idle 27 to 31; Processor 2: , idle from 13 to 21, T8; Processor 3: , idle from 21 to 31

(c) Processor 1: T4, idle 10 to 11, T6, idle 18 to 21, T8; Processor 2: , idle 27 to 31; Processor 3: , idle 11 to 31