Birla Institute of Technology & Science, Pilani

Distance Learning Programmes Division

Second Semester 2008-2009

Mid-Semester Test
(EC-1 Regular)

Course No. : BITS ZG553
Course Title : REAL TIME SYSTEMS
Nature of Exam : Closed Book
Weightage : 40%
Duration : 2 Hours
Date of Exam : 07/02/2009 (FN)
Note:
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. Mobile phones and computers of any kind should not be used inside the examination hall.
4. Use of any unfair means will result in severe disciplinary action.

Q.1 Answer following questions briefly andprecisely:

(a) What does Real-Time mean in Real-Time Systems?
(b) What are the functional parameters of a Real-Time System model?
(c) Compare Deadline-Monotonic Algorithm and Earliest Deadline First
Algorithm.
(d) Compare polling server and Interrupt-driven approach in scheduling of
aperiodic jobs using priority driven scheduling.
(e) What is resource contention? How it is handled? [2 X 5 = 10]

Q.2 A task set T
i
(p, e) ={(8,1); (15,3); (20,4);(22,6)} is to be scheduled by using
Clock-Driven Scheduling. Period is denoted by p and execution time is denoted by
e.
(a) Is the task set schedulable? Justify your answer.
(b) What is the hyperperiod and possible framesize(s)?
(c) How many jobs are there in one hyperperiod? [2 + 6 + 2 = 10]

Q.3 (a). What are the various factors which are responsible for blocking of a task?
Q.3 (b). Verify whether the given task set is schedulable by the Rate-Monotonic
algorithm. Apply sufficient and necessary conditions both to check the
schedulability.
T
i
(p
i
, e
i
, b
i
) = {(10,4,5);(15,3,3);(20,4,0)} Where p is period, e is execution
time and b is blocking time of the task T. [2 + 8 = 10]

Q.4 Consider four periodic tasks in the decreasing order of priority T
1
, T
2
, T
3
and T
4

which share five resources R
1
, R
2
, R
3
, R
4
and R
5
accessed using the Priority
Inheritance Protocol. Compute the maximum blocking time b
i
for each task if
corresponding critical section for each task is given in the table.
(There are no nested critical sections). [10]

T
i
R
1
R
2
R
3
R
4
R
5

T
1
2 5 9 0 6
T
2
0 0 7 0 0
T
3
0 3 0 7 13
T
4
6 0 8 0 10

*********
No. of Pages = 1
No. of Questions = 4