DBATU · Final Year B.Tech Information Technology · Non-NEP
Real Time Systems
BTITPE705A · Elective III · Semester VII · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60
One of the Elective III options.
Unit 1: Introduction and Real-time Scheduling
Hard and soft real-time systems; a reference model; clock-driven, weighted round-robin and priority-driven approaches; dynamic and static systems; effective release times and deadlines; EDF and LST and their optimality; offline and online scheduling.
Examined in the 60-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
- EDF and LST algorithms
Unit 2: Clock-driven and Fixed-priority Scheduling
Static, time-driven schedulers; cyclic schedules and cyclic executives; aperiodic and sporadic jobs in cyclic schedules; fixed- and dynamic-priority algorithms; maximum schedulable utilisation; optimality of RM and DM; schedulability tests for fixed-priority tasks.
Examined in the 60-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
- Rate-monotonic and deadline-monotonic scheduling
- Schedulability tests for fixed-priority tasks
Unit 3: Aperiodic and Sporadic Jobs in Priority-driven Systems
Assumptions and approaches; deferrable servers; sporadic servers; constant-utilisation, total-bandwidth and weighted fair-queuing servers.
Examined in the 60-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 4: Resources and Resource Access Control
Resource contention and access control; non-preemptive critical sections; the basic priority-inheritance and priority-ceiling protocols; stack-based priority ceiling; the preemption-ceiling protocol.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Resource contention and access control
- Priority inheritance protocol
- Priority ceiling protocol
- Stack-based and preemption ceiling protocols
Unit 5: Multiprocessor Scheduling and Synchronization
Models of multiprocessor and distributed systems; task assignment; the multiprocessor priority-ceiling protocol; scheduling end-to-end periodic tasks with the IPS, PM and MPM protocols.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Multiprocessor and distributed system models
- Task assignment
- Multiprocessor priority-ceiling protocol
- End-to-end periodic tasks: PM, MPM and IPS protocols
Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).