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
Round-Robin (RR)
-FCFS with Preemption
-Time quantum (or time slice)
-Ready Queue treated as circular queue
Shortest Remaining Time (SRT)
-Preemptive version of shortest process next policy
-Must estimate processing time