9 docs tagged with "CPU Scheduling"

First Come First Served (FCFS) is a simple scheduling algorithm where processes are handled in the order they arrive, without priority.

An overview of Least Recently Used Scheduling and its applications in programming.

An overview of the Multilevel Queue Scheduling Algorithm and its applications in programming.

Non-Preemptive Priority is a scheduling algorithm where each process is assigned a priority, and the CPU is allocated to the process with the highest priority.

Preemptive Priority is a scheduling algorithm where each process is assigned a priority, and the CPU is allocated to the process with the highest priority.

An overview of Priority Scheduling and its applications in programming.

Round Robin is a scheduling algorithm where each process can use the CPU only for a given time slice or time quantum.

Shortest Job First (SJF) is a simple scheduling algorithm where processes are handled such that the process requiring minimum amount of time is executed first, without priority.

Shortest Remaining Time First (SRTF) is a simple scheduling algorithm where processes are handled such that the process requiring minimum amount of time is executed first.