Part-A
Q. 1. Give a brief note on common approaches to real time scheduling.
Q. 2. Which scheduling algorithm is best suited for high speed networks and why?
Q. 3 Study the feasibility analysis for jobs of LRT algorithm when preemption is allowed.
Part-B
Q.4. Differentiate between static and dynamic systems.
Q.5. Consider a system that has five periodic tasks a, b, c, d, e and three processors p1, p2, p3. The periods of a,b,c are 2 and their execution times are equal to 1. The periods of d and e are 8 and their execution times are 6. The phase of every task is 0 that is the first job of the task is released at time 0. The relative deadline of every task is equal to its period.
Show that if the tasks are scheduled dynamically on three processors according to LST algorithm some jobs in the system cannot meet their deadlines.
Q6. Consider the above scenario and Find a feasible schedule of the five tasks on three processors.