Q1. Explain scheduling in Hard Real Time Operating System.
Ans. A task must be serviced by its deadline. Service after the deadline has expired is the same as no service at all.
Scheduling algorithms that address the deadline requirements of hard real time systems are as follow:
- Rate Monotonic Scheduling
- Earliest Deadline First Scheduling (EDF)
- Pthread Scheduling
- Proportional Share Scheduling