Birla Institute of Technology & Science, Pilani

Work Integrated Learning Programmes Division

M.S. Software Engineering at Wipro Technologies (WASE)
Second Semester 2013 - 2014 (March 2014 to September 2014)
Mid-Semester Test (Regular)
Course Number
Course Title
Type of Exam
Weightage
Duration
Date of Exam

:
:
:
:
:
:

SEWP ZG524
REAL TIME OPERATING SYSTEMS
Closed Book
No. of Pages : 2
30 %
No. of Questions : 6
90 minutes
SUNDAY, 29-06-2014
Session : FN :09:00-10:30

Note:
1. Please read and follow all the instructions given on the cover page of the answerscript.
2. Start each answer from a fresh page. All parts of a question should be answered consecutively.
3. Please answer the questions in the order in which they appear in the question paper.
Q1. Choose the most appropriate option: (Answer should be a/b/c/d only)
[5 X 1 Mark= 5 Marks]
i. Each computation or data transmission that is executed repeatedly at regular or almost regular time intervals in
order to provide a function of the system on a continuing basis is modelled as:
a. periodic task.
b. aperiodic task
c. sporadic task
d. hyper-periodic task
ii. In a digital controller, plant refers to controlled system. Identify the odd one out:
a. an engine
b. brakec. steering
d. seat
iii. The ____________ algorithm is used for scheduling real time traffic in high speed switched networks.
a. Earliest Deadline First
b. weighted round robin
c. priority-driven
d. time-driven
iv. slack-stealing algorithms are used in
a. Round Robin scheduling b. periodic tasks scheduling
c. aperiodic tasks scheduling
d. time driven scheduling
v. A critical section that is not included in other critical sections is _________________
a. innermost critical section
b. normal critical section
c. semi critical section
d. outermost critical section
Q2. The feasible interval of each job in the precedence graph in Figure Q2 is given next to its name. The
execution times of all jobs are equal to 1.
a. Find the effective release times and deadlines of the jobs in the precedence graph.
[3 Marks]
b. Find an EDF schedule of the jobs.
[2 Marks]

Page 1 of 2

Q3. A system of three tasks T1(3.5,1) ; T2(4,1) and T3(5,2,7) is to be scheduled with clock-driven cyclic
executive algorithm.
a. Is the task set schedulable? Justify your answer.
[1 Mark]
b. What are the hyper period and possible frame size(s)?
[2 Marks]
c. Choose the largest frame size and draw a Network Flow Graph.
[2 Marks]
Q4. You work for a company that builds "set-top boxes" which decode digital TV broadcasts. These run some
periodic real-time tasks (the video decoder) and some aperiodic tasks reacting to user input (e.g. the program
guide). Although packaged as a consumer appliance, they are built using standard PC hardware and have much
the same capabilities as an ordinary desktop computer. The company has decided to use Linux as the operating
system for this product, since it provides a convenient development platform, runs a range of useful applications
and libraries, and provides the POSIX 1003.1b extensions of real-time programming.
a. Explain how this choice of operating system impacts the choice of possible scheduling algorithms that can be
used for periodic tasks in the real-time parts of the system, and how it may impact the performance of those
algorithms.
[3 Marks]
b. Your programme guide has been implemented on the Linux-based set-top box. In testing, it is found that the
periodic video decoder task, running with real-time priority, sometimes misses its deadlines when your
programme guide is active. Explain why this might occur.
[2 Marks]
Q5. Consider the real-time program described by the psuedo code below. Names of jobs are in italic.
At 9 AM, start: have breakfast and go to office;
At 10 AM,
If there is class,
teach;
Else, help students;
When teach or help is done, eat_lunch;
Until 2 PM, sleep;
If there is a seminar,
If topic is interesting,
listen;
Else, read;
Else
write in office;
When seminar is over, attend social hour;
discuss;
jog;
eat_dinner;
work a little more;
end_the_day;
Draw a task graph to capture the dependencies among jobs. [5 Marks]
Q6. A system T contains for periodic tasks, (8, 1), (15, 3), (20, 4), and (22, 6).
a. Compute total utilization. [2 Marks]
b. Construct the initial segment in the time interval (0, 50) of a rate-monotonic schedule of the system.[3
Marks]
***********************

Page 2 of 2