Real Time System (RTS) Notes


In this course, we are going to learn about all the basic to advance the topic of Real Time System (RTS). In this post, I’m going to cover all the chapter and related numerical problem of real time system course step by step.

Real Time System (RTS) Notes


1. Introduction

Definition of Real Time System, Type of Real Time System, Digital control, High-level controls, Signal processing, Real time applications

2. Hard versus Soft Real-Time Systems

Jobs and processors, Release times, Deadlines, and timing constraints, Hard and soft timing constraints, Hard real-time systems, Soft real-time systems

3. Reference Model of Real-Time Systems

Processor and resources, Temporal parameters of real-time workload, Periodic task model, Precedence constraints and data dependency, Other dependencies, Functional parameters, Resource parameters of jobs and parameters of resources, Scheduling hierarchy

4. Approaches to Real-Time Scheduling

Clock-driven approach, Weighted round-robin approach, Priority-driven approach Dynamic versus static system, Effective release times and deadlines, Optimality of the EDF and LST, algorithms, Nonoptimality of the EDF and LST algorithms, Challenges in validating timing constraints in priority-driven systems, Off-line versus on-line scheduling

5. Clock-Driven Scheduling

Notations and assumptions, Static, Timer-driven scheduler, General structure of cyclic schedules, Cyclic executives, Improving the average response time of aperiodic jobs, Scheduling sporadic jobs, Practical considerations and generalization, Algorithm for constructing static schedules, Pros and cons of clock-driven scheduling

6. Priority-Driven Scheduling of Periodic Tasks

Static assumption, Fixed-priority versus dynamic-priority algorithms, Maximum schedule utilization, Optimality of the RM and DM algorithms, A schedulability test for fixed-priority tasks with short response times, schedulability test for fixed-priority tasks with arbitrary response times, Sufficient schedulability conditions for the RM and DM algorithms, Practical factor 

7. Scheduling Aperiodic and Sporadic Jobs in Priority-Driven Systems

Assumptions and approaches, Deferrable servers, Sporadic servers, Constant utilization, total bandwidth, and weighted fair-queuing servers, Slack stealing in deadline driven systems, Slack stealing in fixed-priority systems, Scheduling of bs, Real-time performance for jobs, with soft timing constraints, Low-level deadline-driven scheme for integrated scheduling

8. Resources and Resource Access Control

Assumptions on resources and their usage, Effects of resources contention and resource access control, Nonpreemptive critical sections, Basic priority-inheritance protocol, Basic priority-ceiling protocol, Stack-based, priority-ceiling (ceiling- priority) protocol, Use of priority-ceiling protocol in dynamic-priority system, Preemption-ceiling protocol, Controlling accesses to multiple-unit resources, Controlling concurrent accesses to data objects,

9. Multiprocessor Scheduling, Resource Access Control, and Synchronization

Model of multiprocessor and distributed systems, Task assignment, Multiprocessor priority-ceiling protocol, Elements of scheduling algorithms for end-end periodic tasks, End-to-end tasks in heterogeneous systems, Predictability and validation of dynamic multiprocessor systems

10. Real Time Communication

Model of real-time communication, Priority-based service disciplines for switched networks, Weighted round-robin service disciplines, Medium access-control protocols of broadcast networks, Internet and resource reservation protocols, Real-time protocol, Communication in multicomputer systems

Note: You can also find all chapter notes in the same article. each chapter has there answer link above.