REAL TIME SYSTEMS (KOE-061)
B.Tech Semester VI – Theory Examination (2022–23)
REAL-TIME-SYSTEMS-KOE-061
Real Time Systems is a subject that deals with computing systems where time constraints are as important as functional correctness. In such systems, producing the correct result after a deadline is considered a failure. This subject builds a strong foundation for understanding real-time operating systems, scheduling algorithms, concurrency control, communication protocols, and real-time databases. The given question paper is designed to evaluate conceptual clarity, analytical ability, and understanding of real-world real-time applications. To score well, answers must be written in a descriptive, logically connected paragraph format, using correct terminology and examples.
SECTION A – BASIC CONCEPTS OF REAL TIME SYSTEMS
Section A focuses on testing the student’s understanding of fundamental concepts and terminology related to real-time computing. Even though the questions are brief, they cover the core ideas on which the entire subject is built.
When writing about task scheduling, students should explain that scheduling in real-time systems is the process of deciding the execution order of tasks such that all timing constraints, especially deadlines, are satisfied. This differs from conventional scheduling where fairness or throughput is the primary goal.
The explanation of priority-driven approaches must clarify that tasks are assigned priorities, and the scheduler always executes the highest-priority ready task. This approach is widely used in real-time operating systems due to its predictability.
The concept of RAC (Resource Access Control) should be explained in terms of how shared resources are managed to avoid issues such as deadlocks, priority inversion, and race conditions. Real-time applications require deterministic access to resources, making RAC extremely important.
When discussing real-time applications, students should explain systems such as avionics, medical monitoring systems, industrial automation, and automotive control, highlighting how timing constraints are critical in these domains.
Differences between open and closed systems, dynamic and static systems, and explanations of multiple-unit resources, data dependency, RTOS features, and timing constraints should focus on predictability, determinism, and system behavior under time constraints.
SECTION B – SCHEDULING, RESOURCE SHARING, AND COMMUNICATION
Section B requires detailed explanations and deeper understanding. Answers in this section should be written as small essays, combining theory with application.
The explanation of a typical real-time system should describe its components such as tasks, scheduler, resources, clock, and environment, and explain how these components interact to meet deadlines.
When explaining real-time scheduling approaches, students must clearly describe both clock-driven scheduling, where decisions are made at predefined time instants, and weighted round robin scheduling, where tasks are assigned weights to control processor share. The answer should also explain where each approach is suitable.
The stack-based priority ceiling protocol is a very important topic related to real-time resource sharing. Students should explain how it prevents deadlocks and priority inversion by dynamically adjusting task priorities when they access shared resources.
Questions related to Internet and Resource Reservation Protocols test understanding of real-time communication over networks. The explanation should include how resources such as bandwidth are reserved in advance to guarantee timing requirements.
An overview of commercial real-time databases should explain how traditional databases are modified to support deadlines, temporal data, and priority-based transaction execution.
SECTION C – ADVANCED REAL TIME ANALYSIS AND SCHEDULING THEORY
Section C evaluates analytical depth and theoretical understanding. Answers here must be well-structured, explanatory, and supported by reasoning.
The difference between hard and soft real-time systems should clearly explain the consequences of deadline misses. In hard real-time systems, missing a deadline may cause catastrophic failure, while in soft real-time systems, performance degradation is acceptable.
The explanation of temporal parameters of real-time workload and periodic task model should include parameters such as release time, execution time, deadline, and period, and explain how these parameters are used in schedulability analysis.
Questions on optimality of Earliest Deadline First (EDF) and Least Slack Time (LST) require explanation of why these algorithms are considered optimal under certain conditions and how they guarantee deadline satisfaction.
Scheduling of aperiodic and sporadic jobs in both priority-driven and clock-driven systems should be explained with emphasis on unpredictability and techniques used to handle such tasks.
Concurrency control questions should explain why resource contention occurs and how access control mechanisms ensure data consistency and timing predictability.
The explanation of Medium Access Control protocols and real-time communication models should focus on how timing constraints are maintained in shared communication environments.
Finally, questions on UNIX as RTOS, POSIX issues, and temporal data characteristics should explain limitations of general-purpose systems and the need for real-time extensions.
HOW TO WRITE REAL TIME SYSTEMS ANSWERS IN THE EXAM
In Real Time Systems, never write answers in short bullet points. Always start with a clear definition, then explain the concept in detail, followed by examples or applications wherever possible. Use proper real-time terminology such as deadlines, schedulability, predictability, preemption, and resource contention. Even when diagrams or algorithms are asked, they must be supported with clear written explanation. Examiners give high weightage to clarity of thought, logical flow, and correct use of terminology.
