Different cpu scheduling algorithms

First Come, First Served (FCFS)

>> Non-preemptive
>> Treats ready queue as FIFO.
>> Simple, but typically long/varying waiting time.

Shortest Job First (SJF)

>> Give CPU to the process with the shortest next burst
>> If equal, use FCFS
>> Better name: shortest next cpu burst first

Priority Scheduling Algorithms
>> Priority associated with each process
>> CPU allocated to the process with highest priority
>> If equal, use FCFS
=> Internal Priority (time limits, mem requirements, number of open files)
=>External Priority (Critera outside the OS. Choice related to computer usage)

Round-Robin (RR)

>> FCFS with Preemption
>> Time quantum (or time slice)
>> Ready Queue treated as circular queue