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) and the priority list T2,T4,T6,T5,T3,T1. Using the list-processing algorithm, the 6 tasks may be completed on 2 processors in a time of 12. If instead 3 processors are used, how much time (if any) is saved?

Schedule the 6 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 :

Time savings =

Explanation / Answer

1:T4,T5,T6
2:T1,T2,T3
3:12

savings:0

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

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