Previous Year Exam Questions for Real Time Systems - RTS of 2017 - bput by Verified Writer
- Real Time Systems - RTS
- 2017
- PYQ
- Biju Patnaik University of Technology Rourkela Odisha - BPUT
- Computer Science Engineering
- B.Tech
- 1891 Views
- 73 Offline Downloads
- Uploaded 1 year ago
Text from page-1
Registration no: Total Number of Pages: 02 B.Tech. PECS5403 7th Semester Regular / Back Examination 2017-18 Real Time Systems BRANCH: , CSE, IT, ITE Time: 3 Hours Max Marks: 70 Q.CODE: B352 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Q1 a) b) c) d) e) f) g) h) i) j) Q2 a) b) Q3 a) b) Q4 a) Answer the following questions : What are the different types of timing constraints that can occur in a system? Give examples of each. What does the term “real” in a real-time system signify? Explain what do you mean by a real-time system. Explain why safety and reliability are not independent issues in safety-critical hard real-time systems. Is EDF really a dynamic priority scheduling algorithm? What do you mean by jitter associated with a periodic task? How are these jitters caused? Explain using an appropriate example as to why a critical resource can get corrupted if the task using it is preempted and then another task is granted use of the resource. Explain some of the features that you would require a real-time operating system to support. Identify at least two factors which contribute to delay jitter in real-time communications. What is the difference between execution time and response time of a task? In what circumstances can they be different? What is the difference between synchronous I/O and asynchronous I/O? (2 x 10) What is a safety-critical system? Give a few practical examples of safetycritical hard real-time systems. Are all hard real-time systems safety-critical? If not, give at least one example of a hard real-time system that is not safetycritical. What do you understand by the fail-safe state of a system? Safety-critical real-time systems do not have a fail-safe state. What is the implication of this? Explain the key differences between the characteristics of a soft real-time task and a non-real-time task. (5) Prove that a set of periodic real-time tasks in RMA schedulable under any task phasing, iff all the tasks meet their respective first deadlines under zero phasing. What are the basic criteria based on which a real-time task can be determined to belong to one of the following categories: periodic, aperiodic and sporadic? Identify some characteristics that are unique to each of the three categories of tasks. Give examples of tasks in practical systems which belong to each of the three categories. (5) Explain the different types of priority inversions that a task might suffer due to a lower priority task when the priority ceiling protocol is used to share critical resources among a set of real-time task. Can a task suffer both inheritancerelated inversion and direct inversion due to some lower priority task? If you answer in the affirmative, construct a suitable example to corroborate your answer. If you answer in the negative, explain why not. (5) (5) (5)
Text from page-2
b) Consider a real-time system whose task characteristics and dependencies are described in the following table. Assume that the tasks have zero phasing and repeat with a period of 90 mSec. Determine a feasible schedule which could be used by a table-driven scheduler. Task T1 T2 T3 T4 Q5 a) b) Q6 a) b) Q7 Q8 a) b) c) d) Computation time (ei) mSec 30 15 20 10 Deadline (di) mSec 90 40 40 70 (5) Dependency T 1, T 3 T1 T2 When EDF is used for task scheduling in a real-time application, explain a scheme by which sharing of critical resources among tasks can be supported. Give an algorithm in pseudo-code notation to describe the steps to handle resource grant and release. Why is it necessary to synchronize the clocks in a distributed real-time system? Discuss the relative advantages and disadvantages of the centralized and distributed clock synchronization schemes. (5) Why is the clock resolution provided to real-time programs by different commercial real-time operating systems rarely finer than few hundreds of milliseconds though giga hertz clocks are used by these systems? Can clock resolution finer than milliseconds be provided to real-time programs at all? If yes, briefly explain how. Briefly indicate how Unix dynamically recomputes task priority values. Why is such recomputation of task priorities required? What are the implications of such priority recomputations on real-time application development? (5) What do you mean by benchmarking real-time systems? Explain Rhealstone metric with following parameters: task switching time, task preemption time, interrupt latency time, semaphore shuffling time, unbounded priority inversion time and datagram throughput time. (10) Write short answer on any TWO : POSIX Real-time database Highest locker protocol Applications of real-time systems (5) (5) (5 x 2)
Leave your Comments