GUG · Third Year B.Tech. Computer Science and Engineering · NEP 2020
Real Time Operating System
STPECCSE604B · Programme Elective II · Semester VI · 3 credits · IE 10 + mid-semester 10 + ESE 80
One of the Programme Elective II options. Programme Elective II comes with its lab. Digital Forensics, the third option, is printed with an empty syllabus.
Unit 1: Introduction to Real-Time Systems
9 hoursReal-time systems and the WCET; types of real-time system and of tasks; periodic, sporadic and aperiodic jobs; applications and predictability; the reference model; types of scheduler, cyclic and priority-based.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Hard and soft real-time systems
- Reference model of real-time systems
- Clock-driven, round-robin and priority-driven scheduling
Unit 2: Priority-Based and Multiprocessor Scheduling
9 hoursStatic and dynamic priority schedulers: RM, EDF and LST; optimality and non-optimality of EDF; scheduling with precedence constraints; static and dynamic multiprocessor scheduling and the problems of predictability; validating pre-emptive priority scheduling on a uniprocessor.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- EDF and LST algorithms
- Scheduling jobs with precedence constraints
- Multiprocessor and distributed system models
Unit 3: Cyclic Scheduling
9 hoursCyclic scheduling and frame-size constraints; job slicing; aperiodic jobs by slack stealing; sporadic jobs; practical considerations and the drawbacks of cyclic scheduling.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Cyclic executives and clock-driven scheduling
- Scheduling aperiodic and sporadic jobs in cyclic schedules
Unit 4: Fixed- and Dynamic-Priority Schedulability
9 hoursFixed and variable priorities; schedulable utilisation and the EDF schedulability test; unpredictability of dynamic priorities in overload; the Liu-Layland theorem and the optimality of RM for simply periodic systems; critical instants and time-demand analysis; non-preemption, self-suspension, context-switch time, limited priority levels and tick scheduling.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Rate-monotonic and deadline-monotonic scheduling
- Schedulability tests for fixed-priority tasks
- Practical factors in priority-driven scheduling
Unit 5: Aperiodic and Sporadic Jobs in Priority-Driven Systems
9 hoursPolling and background servers; the deferrable server and its parameters; simple sporadic servers; constant utilisation and total bandwidth servers; preemptive weighted fair-queuing servers; scheduling sporadic jobs in fixed- and dynamic-priority systems.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Deferrable and sporadic servers
- Constant utilisation and total bandwidth servers
- Weighted fair-queuing servers
Unit contents are summarised from the official GUG syllabus . AiCanCode.org is not affiliated with Gondwana University, Gadchiroli.