Birla Institute of Technology and Science Pilani

KK Birla Goa Campus

Mid-Semester Examination
Semester I 2020-2021

Time:90 Minutes BITS G553: Real-Time Systems Max marks:100

General Instructions
1. All questions are mandatory
2. You can either write the answers and scan or directly type in a word processing software
3. You can refer to any online/offline materials but strictly no contact with humans
4. You should upload your answers as a single pdf file
5. You should keep your cameras on during the entire duration of the exam

Q1) Using time demand analysis, determine whether the following task set of periodic tasks is
schedulable on a uniprocessor system if they are scheduled based on fixed priority algorithm(Tasks are
independent and preemptible). (20 Marks)

T1(1,3,1,3), T2(7,2), T3(2,9,1,9)

At runtime, if a sporadic job S(3,8) arrives at time instance 3, how can you include its effect into the
time demand curves? Do you think we can decide the schedulability based on this new time demand
curves? (You don’t have to redraw the curves just mention what you will do) (5 Marks)

Q2) A uniprocessor system executes 6 jobs with the following profiles. They are specified using the
notation Jx(release time, deadline, execution time)
J1(2,6,2) J2(1,8,1) J3(1,7,1) J4(1,15,2) J5(0,5,1) J6(3,9,2)
The precedence relation among the jobs is given as J1 < J3, J2 < J3, J3 < J4, J3 < J5, J4 < J6
a) Draw the precedence graph for the tasks (5 Marks)
b) Find the effective release and deadline times of the jobs and redraw the graph (5 Marks)
c) Can you determine whether system is schedulable or not only from this precedence graph? (5
Marks)
d) If LST algorithm is used to schedule these jobs, which job will get scheduled first and why? (5 Marks)

Q3) A system with clock driven scheduling has to schedule the following periodic tasks using a cyclic
executive
T1 = (3, 1), T2 = (4, 1), T3 = (12, 2)
a) Build an offline schedule based on LRT algorithm for the first hyper period by drawing the timing
diagram (Gantt chart) (5 Marks)
b) Determine the best frame size of the cyclic executive for running these tasks (10 marks)
c) Show the schedule using the frame size that you have found out for the first major cycle (5 Marks)
d) If a sporadic job S(2,10) arrives at time instant 4, determine whether you can schedule it for the
above cyclic executive. If yes what is the response time for the sporadic job? (5 Marks)

Q4) A priority driven uniprocessor system runs the following 3 tasks

T1 = (3, 0.5), T2 = (5, 3), T3 = (15, 1)
Tasks T1 and T3 are preemptible but T2 is not preemptible. System is scheduled based on RM.

a) What is the total time demand of J1,1, J2,1 and J3,1 if the phase of T1 at run time can be non-zero? (no
need to draw any curves)
(10 Marks)
b) Comment on the effect of non-preemption on the schedulability of above system (5 Marks)
c) If the system has 2 processors, how the jobs will be scheduled and what is the effect of
schedulability? (5 Marks)

Q5) A system with arbitrary response time runs the following tasks uses RM algorithm for scheduling
T1 = (3, 1), T2 = (5, 3), T3 = (15, 1)

a) Determine first level-1 busy interval (2 Marks)

b) Determine first level-2 busy interval (5 Marks)
c) Comment about the schedulability of the above tasks using a sufficient condition (3 Marks)