Question 8203 – Process-Scheduling

Consider a uniprocessor system executing three tasks T₁, T₂ and T₃, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T₁, T₂ and T₃ requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1^st millisecond and task preemptions are allowed, the first instance of T₃ completes its execution at the end of ______________ milliseconds.

Correct Answer: B

All the processes or tasks are available at the begining of 1st millisecond, means at t=0. So, Gantt chart will be as follows:

∴ At the end of 12 milliseconds, 1st instance of T₃ will complete its execution.