Question

The task times of 12 independent tasks T1 to T12 are given, in minutes, as

2, 7, 4, 10, 10, 3, 3, 6, 11, 5, 8, 9

Use the list processing algorithm to schedule these tasks on three processors, #1, #2, and #3. The tasks are prioritized in the order written above.

(a) Which of these tasks does processor #1 complete?

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

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

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

(c) Which of these tasks does processor #3 complete?

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

(d) Is the schedule optimal?

Need more information to decide, No or Yes

(e) How long is an optimal schedule for these 12 tasks? ____ minutes

Answer 1

Given: T1: 2, T2:7, T3:4, T4:10, T5:10, T6:3, T7:3, T8:6, T9:11, T10:5, T11:8, T12:9 which is According to priorities

So the process allocation to the processor will be:

(a) tasks completed by processor 1: T1, T4, T8, T11

(b) Tasks completed by processor 2: T2,T6, T7, T9

(c) Tasks completed by processor 3: T3, T5, T10, T12

(d) yes, its is an optimal schedule

(e) It took 28 minutes to complete these 12 Tasks by this optimal schedule