×
SET SOME GOALS. STAY QUIET ABOUT THEM. SMASH THE HELL OUT OF THEM. CLAP FOR YOUR DAMN SELF.
--Your friends at LectureNotes
Close

Previous Year Exam Questions of Real Time Systems of bput - RTS by Verified Writer

by Verified WriterVerified Writer
Type: PYQInstitute: Biju Patnaik University of Technology BPUT Course: B.Tech Specialization: Computer Science EngineeringOffline Downloads: 80Views: 5574Uploaded: 10 months ago

Share it with your friends

Suggested Materials

Leave your Comments

Contributors

Verified Writer
Verified Writer
Registration No : Total Number of Pages : 03 B.Tech. PCS5D001 5th Semester Regular Examination 2017-18 Real Time Systems BRANCH : CSE Time : 3 Hours Max Marks : 100 Q.CODE : B304 Answer Question No.1 and 2 which are compulsory and any four 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) c) d) e) Answer the following questions: multiple type or dash fill up type Preemptive, priority based scheduling guarantees: (i) hard real time functionality (ii) soft real time functionality (iii) protection of memory (iv) protection of devices. Priority inversion is solved by use of _________. (i) priority inheritance protocol (ii) two phase lock protocol (iii) time protocol (iv) all of these. Type of processor in which single task of particular application is called (i) real time processor (ii) dedicated processor (iii) applicant processor (iv) one task processor. Each time a clock interrupt occurs, besides incrementing the software clock, the handler routine carries out which of the following activities? (i) Process timer events (ii) Update ready list (iii) Update execution budget (iv) All of these Which one of the following is not the deficiencies of Unix? (i) Device driver support (ii) Real-time file service (iii) Dynamic priority recomputations (iv) Hierarchical file system POSIX stands for __________. (i) Portable Operating System Interface (ii) Portable Operating System Input (iii) Platform Operating System Interface (iv) Platform Operating System Input Which of the following are commercially claimed RTOSs? (i) Linux (ii) Windows CE (iii) Windows NT (iv) SunSolaris _________ traffic arises due to constant bit rate data generation. (i) CBR (ii) VBR (iii) Sporadic (iv) All of these Which of the following describes the RTOS design philosophy best? (i) Maximize the throughput of the system (ii) Maximize the processor utilization (iii) Minimizing the response time (iv) Response within certain stipulated time period _________ is/are two popular dynamic real-time task allocation algorithms. (i) Focussed addressing and bidding (ii) Buddy algorithm (iii) EDF (iv) Both (i) and (ii) (2 x 10) Answer the following questions: Short answer type What do you understand by the term “real-time”? How jitter is associated with a periodic task? Give an example of a soft real-time task and a non-real-time task. What do you mean by the “fail-safe” state of a system? What do you understand by an optimal scheduling algorithm? Is it true that the time complexity of an optimal scheduling algorithm for scheduling a set of real-time tasks in a uniprocessor is prohibitively expensive to be of any practical use? Explain your answer. (2 x 10)
f) g) h) i) j) Q3 a) b) Q4 a) In a hard real-time system, is it necessary that every task in the system be of hard real-time type? Explain your answer using a suitable example. In a real-time system what is the difference between a performance constraint and a behavioral constraint? What is an open system? What are its advantages compared to a closed system? Explain a real-time communication protocol that can be used in a CAN. What is a watchdog timer? What do you mean by scheduling point of a task scheduling algorithm? How are the scheduling points determined in clock-driven, event driven and hybrid schedulers? How will your definition of scheduling points for the three classes of schedulers change when (i) self-suspension of tasks and (ii) context switching overheads of tasks are taken into account. Briefly explain while scheduling a set of hard real-time periodic tasks, why RMA cannot achieve 100% processor utilization without missing task deadlines. (10) Consider a real-time system which consists of three tasks T1, T2 and T3 which have been characterized in the following table. (10) Task Phase mSec T1 20 T2 40 T3 70 b) Q5 a) Relative Deadline mSec 20 50 80 Period mSec 20 50 80 If the tasks are to be scheduled using a table-driven scheduler, what is the length of time for which the schedulers have to be stored in the precomputed schedule table of the scheduler. Explain the operation of priority ceiling protocol (PCP) in sharing critical resources among real-time tasks. Explain how PCP is able to avoid deadlock and chain blockings. 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 T2 and T3 meet their respective deadlines when priority ceiling protocol is used for resource scheduling? Task T1 T2 T3 T4 T5 b) Execution time mSec 10 10 20 pi 400 200 300 250 450 ei 30 25 40 35 50 R1 15 10 - R2 20 20 10 - (5) (5) (10) R3 10 10 5 pi indicates the period of task T i and ei indicates its computation time. The period of each task is the same as its deadline. The entries in the R1, R2 and R3 columns indicate the time duration for which a task needs the named resource in non-preemptive mode. Assume that after a task releases a resource, it does not acquire the same or any other resource. Explain some of the features that you would require a real-time operating system to support. (5)
Q6 a) Consider the following set of four independent real-time periodic tasks. Task Start-time mSec T1 20 T2 40 T3 20 T4 60 b) Q7 a) b) Q8 a) b) Q9 a) b) Processing-time mSec 25 10 15 50 (10) Period mSec 150 50 50 200 Assume that task T3 is more critical than task T2. Check whether the task set can be feasibly scheduled using RMA. Justify your answer. Is RMA optimal when the task deadlines differ from the task periods? What is the difference between synchronous I/O and asynchronous I/O? What are the implications of these two types of I/O for real-time applications? (5) Consider a calendar-based reservation protocol to transmit real-time messages over a collision-based network: (i) Explain how transmission of asynchronous messages by nodes can be handled. Note that asynchronous messages have probabilistic arrival times and do not have any specified time bounds. (ii) Explain with proper reasoning the types of traffics for which a calendarbased protocol would perform satisfactory and the types for which it will not. Explain how a real-time operating system differs from a traditional operating system. Name a few real-time operating systems that are commercially available. (10) Answer the following in the context of a chemical manufacturing company that wishes to automate its process control application: (i) What problems might arise if an attempt is made to implement the chemical plant control software using the Ethernet LAN available in the factory? (ii) How can a global priority protocol be supported in a LAN with collisionbased access? (iii) If RMA scheduling of packets is to be supported, what is the maximum channel utilization that can be achieved? (iv) What are the main obstacles to efficient implementation of RMA in this set up? Would it be advisable to use an Ethernet LAN in a hard real-time application such as factory automation? Justify your answer. Evaluate the pros and cons of using an Ethernet-based protocol in such an application. (10) What do you mean by QoS routing? Explain the different types of QoS routing algorithms. Explain why traffic gets distorted in a multisegment network and how traffic reshaping is achieved for providing QoS guarantee. (10) (5) (5) (5)

Lecture Notes