DOEACC Society 2006 DOEACC C Level CE7 - Real Time Systems( ) - Question Paper

CE7-R3: REAL TIME SYSTEMS
NOTE:
Time: three Hours Total Marks: 100
1.
a) elaborate the 5 main steps that together constitute “task switching”?
b) discuss the necessity of precedence graph with an example.
c) What is the difference ranging from RTOS and general-purpose operating systems?
d) Why is it difficult to predict response time in real time system? How do you overcome the
problem?
e) How is wormhole routing used for packet transmission in a multihop network?
f) How does absolute and relative consistency differ from every other?
g) List atleast 3 uni-processor scheduling algorithms and discuss then briefly.
(7x4)
2.
a) What is Task scheduling? discuss it with a timing diagram.
b) elaborate the properties defining performance measures for real time system?
c) elaborate the components of a real time system? provide a diagrammatic representation.
(8+4+6)
3.
a) How faults are classified and discuss them with a state diagram.
b) How can a real time system be kept running despite the failure of a few of its parts? provide al
lowest 4 methods briefly.
c) List out the timing specification a good real-time language should hold.
d) provide a note on advantages and disadvantage of hardware synchronization.
(6+4+4+4)
4.
a) Which is the protocol widely sued for single channel broadcast network and the bus and ring
topology? discuss and draw the algorithm of this protocol.
b) discuss Time-token protocol in detail with a flow chart.
c) elaborate the different forms of fault recovery?
(7+7+4)
5.
a) Prove that the Rate monotonic algorithm is an optimal static-priority algorithm.
b) Comment on the suitability of FDDI protocol for the real time applications.
c) explain the problems in dynamic scheduling.
CE7-R3 Page one of two July, 2006
1. ans ques. one and any 4 ques. from two to 7.
2. Parts of the identical ques. should be answered together and in the identical
sequence.
(8+3+7)
CE7-R3 Page two of two July, 2006
6.
a) Why a Real time databases should compromise a few of the ACID properties of
conventional databases?
b) discuss the concurrency control problems for databases.
c) elaborate the features of network topology for a distributed system, and illustrate few
topologies neatly.
(4+4+10)
7.
a) Determine whether the subsequent set of periodic tasks is schedulable on a uniprocessor
using RMA ignoring situation switch overhead.
Task Processing-time (mSec) Period (mSec)
T1 38 112
T2 60 190
T3 72 425
Now, Suppose situation switch overhead of one milli Seconds is to be taken into account, determine
the schedulability.
b) discuss static pairing.
Draw the schematic of a timing estimation system and briefly discuss the identical.
(8+5+5)
CE7-R3 Page three of two July, 2006

Earning:   Approval pending.