CPU scheduling notebooks

Here are some common CPU scheduling algorithms:

• First-Come, First-Served (FCFS): Processes are executed in the order they arrive in the ready queue.
• Shortest Job Next (SJN): The process with the smallest estimated execution time is selected next. This can be preemptive or non-preemptive.
• Priority Scheduling: Each process is assigned a priority, and the CPU is allocated to the process with the highest priority. Priorities can be static or dynamic.
• Round Robin (RR): Each process is given a small unit of CPU time (time quantum). When the time quantum expires, the process is preempted and added to the end of the ready queue.
• Multilevel Queue Scheduling: The ready queue is partitioned into several separate queues, each with its own scheduling algorithm. Processes are permanently assigned to a queue based on some property.
• Multilevel Feedback Queue Scheduling: Allows processes to move between queues based on their CPU usage. This prevents starvation and allows the system to adapt to different process types.

The choice of scheduling algorithm depends on the specific requirements of the system, such as whether it's a batch system, interactive system, or real-time system.