Birla Institute of Technology & Science, Pilani

Work Integrated Learning Programmes Division

Second Semester 2021-2022
Mid-Semester Test
(EC-2 Regular)

Course No. : BITS ZG553

Course Title : REAL TIME SYSTEMS
Nature of Exam : Open Book
Weightage : 35% No. of Pages = 3
Duration : 2 Hours No. of Questions = 4
Date of Exam : Friday, 05/03/2021 (FN)
Note to Students:
1. Please follow all the Instructions to Candidates given on the cover page of the answer book.
2. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
3. Assumptions made if any, should be stated clearly at the beginning of your answer.

Q.1 Set. (A)

A set of periodic tasks Ti (Pi,ei,Di)= {(8,2,10),(6,2,6),(24,3,24),(16,2,16)} are to be scheduled
using a structured frame-based cyclic scheduling algorithm on a single processor.
a) Are the tasks schedulable? Justify.
b) Determine all the possible frame sizes.
c) Draw a neat and legible schedule clearly showing the jobs scheduled in each frame. Comment
on the schedulability of the tasks.
d) If there are Aperiodic jobs Ai (ri, ei) ={ (7,2), (15,2), (20,1)} in this system, how will they be
scheduled if cyclic-executive schedule is used to schedule them.
e) Now if there are three Sporadic jobs in the system S1, S2 and S3. S1 arrives at t=10 and it
requires 2-time units on the processor to execute it. Relative deadline of S1 is 16. Similarly, S2
arrives at t=12, it requires 2.5-time units on the processor to execute it and its relative deadline is
15. S3 arrives at t=20, it requires 1 time unit on the processor to execute it and its relative
deadline is 4. Determine whether these jobs will be accepted or rejected. Show the necessary
calculations/justifications for the same.
Marks: 17

Q.1 Set. (B)

A set of periodic tasks Ti (Pi,ei,Di)= {(8,2,10),(16,2,16),(32,3,32),(4,1,6)} are to be scheduled
using a structured frame-based cyclic scheduling algorithm on a single processor.
a) Are the tasks schedulable? Justify.
b) Determine all the possible frame sizes.
c) Draw a neat and legible schedule clearly showing the jobs scheduled in each frame. Comment
on the schedulability of the tasks.
d) If there are Aperiodic jobs Ai (ri, ei) ={ (8,2), (16,2), (21,1)} in this system, how will they be
scheduled if cyclic-executive schedule is used to schedule them.
e) Now if there are three Sporadic jobs in the system S1, S2 and S3. S1 arrives at t=10 and it
requires 2-time units on the processor to execute it. Relative deadline of S1 is 17. Similarly, S2
arrives at t=13, it requires 2.5-time units on the processor to execute it and its relative deadline is
18. S3 arrives at t=20, it requires 1 time unit on the processor to execute it and its relative
deadline is 10. Determine whether these jobs will be accepted or rejected. Show the necessary
calculations/justifications for the same.
Marks:17
Q.1 Set. (C)
A set of periodic tasks Ti (Pi,ei,Di)= {(10,2,12),(15,2,15),(30,3,30),(5,1,7)} are to be scheduled
using a structured frame-based cyclic scheduling algorithm on a single processor.
a) Are the tasks schedulable? Justify.
b) Determine all the possible frame sizes.
c) Draw a neat and legible schedule clearly showing the jobs scheduled in each frame. Comment
on the schedulability of the tasks.
d) If there are Aperiodic jobs Ai (ri, ei) ={ (8,2), (16,2), (21,1)} in this system, how will they be
scheduled if cyclic-executive schedule is used to schedule them.
e) Now if there are three Sporadic jobs in the system S1, S2 and S3. S1 arrives at t=10 and it
requires 1.5-time units on the processor to execute it. Relative deadline of S1 is 15. Similarly, S2
arrives at t=13, it requires 2.5-time units on the processor to execute it and its relative deadline is
18. S3 arrives at t=20, it requires 1 time unit on the processor to execute it and its relative
deadline is 10. Determine whether these jobs will be accepted or rejected. Show the necessary
calculations/justifications for the same.
Marks: 17

Q.2Set. (A)
a) A system of four tasks Ti (Pi, ei) = {(20,2,12), (10,1.5,6), (30,0.5,18) (40,1.5,24)} is
scheduled using DMA. Without performing actual simulation, determine whether these set of
tasks are schedulable.
b) Now if the same set of tasks in part-a of this question are scheduled using EDF, determine
whether these set of tasks are schedulable.
Marks: 8

Q.2Set. (B)
a) A system of four tasks Ti (Pi, ei) = {(10,2,7), (20,1.5,14), (30,0.5,21) (40,1.5,28)} is
scheduled using DMA. Without performing actual simulation, determine whether these set of
tasks are schedulable.
b) Now if the same set of tasks in part-a of this question are scheduled using EDF, determine
whether these set of tasks are schedulable.
Marks: 8

Q.2Set. (C)
a) A system of four tasks Ti (Pi, ei) = {(10,2,8), (20,1.5,16), (30,0.5,24) (40,1.5,32)} is
scheduled using DMA. Without performing actual simulation, determine whether these set of
tasks are schedulable.
b) Now if the same set of tasks in part-a of this question are scheduled using EDF, determine
whether these set of tasks are schedulable
Marks: 8

Q.3Set. (A)
A system of four tasks Ti (Pi, ei) = {(30,2), (10,1.5,6), (15,0.5,12) } is scheduled using DMA.
Draw a Gantt chart schedule for this set of tasks and determine if they are schedulable.
Marks:5

Q.3Set. (B)
A system of four tasks Ti (Pi, ei) = {(30,2), (10,1.5,13), (15,0.5,8) } is scheduled using RMA.
Draw a Gantt chart schedule for this set of tasks and determine if they are schedulable.

Marks:5
Q.3Set. (C)
A system of four tasks Ti (Pi, ei) = {(24,2), (8,1.5,10), (12,0.5,8) } is scheduled using DMA.
Draw a Gantt chart schedule for this set of tasks and determine if they are schedulable.
Marks:5

Q.4 Set. (A)

(a) What is the purpose of first frame constraint of the structured cyclic scheduling in clock
driven scheduling?
(b) If the demand curve of a set of tasks in the Graphical method of Time Demand Analysis
(TDA) always lies above the demand=time line, what can we comment about the
schedulability of the set of tasks. Give reasons for the same.
Marks: 5

Q.4 Set. (B)

a) What is the purpose of second frame constraint of the structured cyclic scheduling in
clock driven scheduling?
b) If the demand curve of a set of tasks {T1, T2, …Ti} in the Graphical method of Time
Demand Analysis (TDA) meets the demand=time line at t=Di+1, what can we comment
about the schedulability of the set of tasks. Give reasons for the same. The critical instant
for this graph is t=0.
Marks: 5

Q.4 Set. (C)

a) What is the purpose of third frame constraint of the structured cyclic scheduling in clock
driven scheduling?
b) Time Demand Analysis (TDA) meets the demand=time line at t=Di-1, what can we
comment about the schedulability of the set of tasks. Give reasons for the same. The
critical instant for this graph is t=0.
Marks: 5

*******