National Institute of Technology, Rourkela

Assignment 1, Spring 2022

Real Time System Design (CS6414)
6th semester B.Tech in Computer Science & Engineering
Q 1. State whether you consider the following statements to be TRUE or FALSE. Justify your answer in each case.

(a) A hard real-time application is made up for only hard real-time tasks.
(b) Every safety-critical real-time system has a fail-safe state.
(c) Average response time is an important performance metric for real-time operating systems handling running
of real-time tasks.
(d) When a set of real-time tasks are scheduled using RMA and share critical resources the priority ceiling
protocol (PCP), it is possible that a task may be denied access to a resource even when the resource is not
required by any other task.
(e) Highest locker protocol (HLP) maintains the tasks waiting for a shared non-preemptable resource in FIFO
order.
Q 2. Construct an extended finite state machine (EFSM) model of a telephone system whose (partial) behaviour is
described below.
After lifting the receiver handset, the dial tone should appear within 20 sec. If a dial tone cannot be given
within 20 sec, then an idle tone is produced. After the dial tone appears, the first digit should to be dialled
within 10 sec and the subsequent five digits within 5 sec of each other. If the dialling of any of the digits is
delayed, then an idle tone is produced. The idle tone continues until the receiver handset is replaced.

Q 3. Three hard real-time periodic tasks T1 =(50 msec, 100 msec, 100 msec), T2 =(70 msec, 200 msec, 200 msec),
and T3 =(60 msec, 400 msec, 400 msec) are to be scheduled on a uniprocessor using RMA. Can the task set be
feasibly be scheduled? Suppose context switch overhead of 1 msec is to be taken into account, determine the
schedulability.
Q 4. A set of hard real-time periodic tasks need to be scheduled on a uniprocessor using RMA. The following table
contains the details of these periodic tasks and their use of three non-preemptable shared resources. Can
the tasks T1 and T2 meet their respective deadlines when priority ceiling protocol (PCP) is used for resource
scheduling? pi indicates the period of task Ti and ei indicates its computation time. The period of each task

Task pi ei R1 R2 R3
T1 400 30 15 20 –
T2 200 25 – 20 10
T3 300 40 – – –
T4 250 35 10 10 10
T5 450 50 – – 5

is the same as its deadline. The entries in R1 , R2 and R3 columns indicate the time duration for which a task
needs the named resouce in non-preemptive mode. Assume that after a task releases a resource, it does not
acquire the same or any other resource.