Birla Institute of Technology & Science, Pilani

Distance Learning Programmes Division

Second Semester 2007-2008

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 : 02/02/2008 (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 brought inside the examination hall.
4. Use of any unfair means will result in severe disciplinary action.
5. All the notations have usual meaning.

Q.1 Answer the following questions in short and to the point.
a) In a Real-Time System, what can be the time related activities?
b) In clock driven scheduling algorithm, what is ensured by satisfying each of the
frame constraints?
c) Compare polled execution versus interrupt driven execution in priority-driven
systems.
d) What is nested demand of resources? How it is denoted?
[2 + 2 + 2 + 2 = 8]

Q.2 Consider the preemptible jobs of the precedence graph below (the execution time
and feasible interval is after the name of each job)

a) Schedule the jobs on one processor using preemptible EDF scheduling with
the given release times and deadlines. Is the schedule feasible?
b) Compute the effective release times and deadlines of the jobs.
c) Schedule the jobs on one processor using preemptive EDF scheduling using
the effective release times and deadlines. At which points in time is it
necessary to look at the precedence graph? Is the schedule feasible?
[4 + 3 + 4 = 11]
J
1
{1, (0, 5]} J
7
{1, (2, 13]} J
5
{3, (4, 12]} J
3
{2, (1, 8]}
J
8
{1, (7, 12]} J
2
{1, (0, 7]} J
6
{1, (3, 4]} J
4
{2, (0, 7]}
No. of Pages = 2
No. of Questions = 5
BITS ZG553 (EC-1 REGULAR) SECOND SEMESTER 2007-2008 PAGE 2

Q.3 Consider the periodic tasks T
1
(3, 1), T
2
(10, 2), and T
3
(15, 3).
i) Construct an cyclic executive schedule for the tasks for the duration of one
hyperperiod starting at time t = 0.
ii) Describe briefly two ways to add the capability of running aperiodic jobs to
the cyclic executive scheduling algorithm that guarantee that no job of any
periodic task misses its deadline. Which of the two methods gives a better
response time in the case of the system of previous part for the aperiodic task
r = 3, e = 1? [3 + 4 = 7]
Q.4 Consider the three periodic tasks:
T
1
(4, 1), T
2
(5, 2), and T
3
(9, 4)
i) What is the total utilization?
ii) Give a valid DM schedule for these for the time interval [0, 32].
iii) How would the RM schedule differ from the DM one for this time
interval? [1 + 3 + 3 = 7]

Q.5 (a). What is priority avoidance blocking? Explain with the help of resource graph.

Q.5 (b). Explain, giving suitable justification, how nonpreemptive critical section
protocol reduces blocking time than preemptive critical section?
[3 + 4 = 7]


**********