SET-A REAL TIME SOFTWARE AND SYSTEMS SECTION:KE085 MARKS:30 Note: Q1 and Q2 contains 10 marks and Q3 and Q4 contains

5 marks.

Q1. A system contains nine nonpreemptable jobs named Ji, for i = 1, 2, . . . , 9. Their execution times are 3, 2, 2, 2, 4, 4, 4, 4, and 9, respectively, their release times are equal to 0, and their deadlines are 12. J1 is the immediate predecessor of J9, and J4 is the immediate predecessor of J5, J6, J7, and J8. There is no other precedence constraints. For all the jobs, Ji has a higher priority than Jk if i < k. (a) Draw the precedence graph of the jobs. (b) Can the jobs meet their deadlines if they are scheduled on three processors? Explain your answer. Q2. Given a figure. Find the schedule of jobs on two processors using EDF algorithm when the jobs are preemptive.

Q3. When preemption is allowed and jobs do not contend for resources, the EDF algorithm can produce a feasible schedule of a set J of jobs with arbitrary release times and deadlines on a processor if and only if J has feasible schedules. Justify with the help of example. Q4. Explain the concept of clock driven scheduling with the help of example.

SET-B REAL TIME SOFTWARE AND SYSTEMS SECTION:KE085 MARKS:30 Note: Q1 and Q2 contains 10 marks and Q3 and Q4 contains 5 marks.

Q1. A system contains nine nonpreemptable jobs named Ji, for i = 1, 2, . . . , 9. Their execution times are 3, 2, 2, 2, 4, 4, 4, 4, and 9, respectively, their release times are equal to 0, and their deadlines are 12. J1 is the immediate predecessor of J9, and J4 is the immediate predecessor of J5, J6, J7, and J8. There is no other precedence constraints. For all the jobs, Ji has a higher priority than Jk if i < k. (a) Can the jobs meet their deadlines if we make them preemptable and schedule them preemptively. Explain your answer. (b) Can the jobs meet their deadlines if they are scheduled nonpreemptively on four processors? Explain your answer. Q2. Consider a system that has five periodic tasks, A, B, C, D, and E, and three processors P1, P2, P3. The periods of A, B, and 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 the EDF algorithm, some jobs in the system cannot meet their deadlines. Q3. When preemption is allowed and jobs do not contend for resources, the LRT algorithm can produce a feasible schedule of a set J of jobs with arbitrary release times and deadlines on a processor if and only if feasible schedules of J exist. Justify with the help of example. Q4. Explain the concept of weighted round robin scheduling with the help of example.

SET-C REAL TIME SOFTWARE AND SYSTEMS SECTION:KE085 MARKS:30 Note: Q1 and Q2 contains 10 marks and Q3 and Q4 contains 5 marks.

Q1. A job is said to be at level i if the length of the longest path from the job to jobs that have no successors is i . Find the level of each job. Suppose that the priorities of the jobs are assigned based on their levels: the higher the level, the higher the priority. Find a priority-driven schedule of the jobs in Figure below according to this priority assignment.

Q2. Consider a system that has five periodic tasks, A, B, C, D, and E, and three processors P1, P2, P3. The periods of A, B, and 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 the LST algorithm, some jobs in the system cannot meet their deadlines. Q3. Whether the EDF and the LST algorithms remain optimal if pre-emption is not allowed or there is more than one processor. Justify your answer with the help of example. Q4. Explain the concept of priority driven algorithm with the help of example.

SET-D REAL TIME SOFTWARE AND SYSTEMS SECTION:KE085 MARKS:30 Note: Q1 and Q2 contains 10 marks and Q3 and Q4 contains 5 marks.

Q1.

Find the EDF schedule for these jobs on two processors when the execution time of all the jobs is 1. Q2. Given three jobs J1,J2,J3. Their execution times are 1,2 and 5 and their deadlines are 1,3,5 respectively. The release times of all three jobs are 0. The system has two processors. Schedule these jobs using EDF algorithm and LST algorithm. Q3. When preemption is allowed and jobs do not contend for resources, the LST (MLF) algorithm can produce a feasible schedule of a set J of jobs with arbitrary release times and deadlines on a processor if and only if feasible schedules of J exist. Justify your answer with the help of example. Q4. Explain the concept of static time driven scheduler with the help of example.