presentation

Def

Now I will explain Preemptive Priority Scheduling.

This is a CPU scheduling algorithm where each process is assigned a priority. The CPU always runs the process with the highest priority. If a new process with a higher priority arrives, it can interrupt the current process and take control of the CPU

Adv

The main advantages are that it provides fast response times for important tasks, making it suitable for real-time systems, and ensures critical processes get CPU time quickly.

Disadv

However, it also has some disadvantages. It can cause more overhead because of frequent context switching, and maintaining priority information requires extra processing.

Starvation

A major problem is starvation, where low-priority processes may wait for a very long time because higher-priority processes keep running.

Aging

To solve this, we use aging. Aging gradually increases the priority of waiting processes, allowing them to eventually get CPU time and preventing indefinite waiting.