Briefly describe the Completely Fair Scheduler (CFS), Round Robin scheduling, and Real-Time scheduling. How does each policy determine the next process to run?
The completely fair scheduling algo aims to divide CPU time fairly among all running processes. It maintains a red black tree of processes and select the leftmost node( the process that has recieved the least CPU time ) to run next.
Round Robin scheduling assigns a fixed time slice to each process in the run queue. After each time slice, the next process in the queue is selected.
The Real time scheduling policies prioritize real-time tasks over normal tasks. These policies ensure that critical processes gets CPU time as required by their real-time constraints.
