The task times of 6 independent tasks T1 to T6 are given, in minutes, as

11, 10, 9, 11, 4, 7

Use the decreasing-time-list algorithm to schedule these tasks on two processors, #1 and #2. Then answer the following questions: (a) Which of these tasks does processor #1 complete?

T1 T2 T3 T4 T5 T6

(b) Which of these tasks does processor #2 complete?

T1 T2 T3 T4 T5 T6

(c) Is the schedule optimal?

Yes, No or More information is needed

Use the priority list T1, T2, T3, T4, T5, T6, schedule the tasks on two processors. Then answer the following questions: (d) Which of these tasks does processor #1 complete?

T1 T2 T3 T4 T5 T6

(e) Which of these tasks does processor #2 complete?

T1 T2 T3 T4 T5 T6

(f) Is the schedule optimal?

More information is needed, No or Yes

(g) How long is an optimal schedule for these 6 tasks? _____ minutes