Birla Institute of Technology & Science, Pilani

Work-Integrated Learning Programmes Division

Second Semester 2013-2014

Comprehensive Examination
(EC-3 Regular)

Course No. : BITS ZG553
Course Title : REAL TIME SYSTEMS
Nature of Exam : Open Book
Weightage : 50%
Duration : 3 Hours
Date of Exam : 06/04/2014 (AN)
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. Assumptions made if any, should be stated clearly at the beginning of your answer.

Q.1. Answer following questions in short and to the point only.

(a) What are advantages of flash memory over EEPROM ? (Any two.)
(b) What are the advantages of microkernel approach in RTOS ?
(c) What is time and space exclusion policy in fault tolerant RTS ? What types
of redundancies are included in it?
(d) What are the faults that can occur while handling message queues which
may lead to timing anomaly?
(e) People say, there is nothing new in Real-Time Systems. All problems can
be solved in other branches of engineering. Do you agree after studying the
course? [5 X 2 = 10]

Q.2. A system of three tasks T
1
= (8,2), T
2
= (10,2), T
3
= (14,4,18) is scheduled with
executive cyclic clock driven scheduling algorithm.

A stream of sporadic jobs arrives as follows, S
i
= {(5, 2,15) ;(13,3,40); (14,2,35)}
Schedule these sporadic jobs applying acceptance test. [10]

Q.3. Now try to schedule these sporadic jobs (Q.2) using sporadic server and deadline
driven approach. T
2
now acts as sporadic server. [8]

Q.4. A set of hard real-time periodic tasks need to be scheduled using RMA. The
following information contains the details of these tasks and their use of shared
resources.
Can all the tasks meet their respective deadlines when priority ceiling protocol is
used for resource scheduling?
Tasks T
i
: T
1
(40,5,20); T
2
(30,5,25); T
3
(35,5,30);
T
4
(60,6,40); T
5
(55,5,50)
Resource Requirements : T
1
: [R
1
:3] ; T
2
: [R
2
:4] ;
T
3
: [R
2
:4 [R
1
:2]] ; T
4
: [R
1
:4 [R
2
:2]] ; T
5
: [R
2
:3]
[12]

Q.5. With the help of suitable Petri Net illustrations, show how Petri Nets can be
represented for
(i) Sequencing (ii) Branching (iii) Synchronization
(iv) Contention (v) Concurrency [10]
__________
No. of Pages = 1
No. of Questions = 5