Consider the order-requirement digraph above, where all indicated weights are in

Question

Consider the order-requirement digraph above, where all indicated weights are in minutes. Using critical-path scheduling, what should the priority list be?

Enter the task list, ordered left-to-right, separating task labels by commas. For example: T4,T1,T2,T5,T3 :

Suppose that Priority List 1 is : T7,T3,T1,T4,T5,T6,T2 and that Priority List 2 is obtained using critical-path scheduling. Using List 1 and the list-processing algorithm, schedule the 7 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 List 2 and the list-processing algorithm, schedule the 7 tasks on 3 processors.

Processor 1 :
Processor 2 :
Processor 3 :

Which of the two lists will result in the smallest completion time? How much time, if any, is saved?

The best priority list is (Enter 'SAME' if the completion times are the same) :

Time savings (Enter '0' if there is no time difference) :

Explanation / Answer

This is the correct answer: T1,T2,T3,T4,T5,T7,T6 1:T3,T7,2,T4,T6 2:T1,3 3:T2,T5,5 1:T1,T4,T6 2:T2,T5,5 3:T3,T7,5 SAME 0

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

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