CPU Scheduling Algorithms

• First-Come, First-Served

• • Processes are moved to the CPU in the order in which they arrive in the running state

• Shortest Job Next

• • Process with shortest estimated running time in the ready state is moved into the running state first

• Round Robin

• • Each process runs for a specified time slice and moves from the running state to the ready state to await its next turn if not finished