Consider the order-requirement digraph above, and the priority lists given below

Question

Consider the order-requirement digraph above, and the priority lists given below:
List 1 : T4,T5,T1,T7,T8,T6,T3,T2,T9
List 2 : T9,T1,T5,T4,T2,T8,T3,T7,T6
List 3 : T8,T3,T5,T2,T4,T1,T7,T6,T9

Using Priority List 1, apply the list-processing algorithm to schedule the 9 tasks on 3 processors. Enter the task labels and idle times (if any) in order for each processor, separated by commas. For example: 3,T1,T2,4,T5,6

Processor 1 :
Processor 2 :
Processor 3 :

Using Priority List 2, apply the list-processing algorithm to schedule the 9 tasks on 3 processors.

Processor 1 :
Processor 2 :
Processor 3 :

Using Priority List 3, apply the list-processing algorithm to schedule the 9 tasks on 3 processors.

Processor 1 :
Processor 2 :
Processor 3 :

Which priority list(s) will be completed in the least amount of time : 1, 2 or 3? Comma separate the list numbers, if more than one list has the smallest completion time.

List number(s) =

What is the smallest possible completion time?

Completion time =

Explanation / Answer

1:T4,T5,T6,T9 2:T1,T7,T2,4 3:T3,T8,5 1:T1,T9 2:T4,T5,T3,T6 3:T2,T8,T7 1:T3,T5,T6 2:T2,T1,T9 3:T4,T8,T7 List 2 finishes first 7 minutes

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.