PROCESS SCHEDULING

Process Scheduling Algorithms

Process Scheduling Algorithms

This paper presents a comparison of four processor scheduling algorithms namely: First Come First Serve (FCFS), Round Robin (RR), Shortest Process Next (SPN), and Shortest Remaining Time (SRT)

First Come First Serve (FCFS)

This non-preemptive scheduling algorithm follows the first-in, first-out (FIFO) policy. As each process becomes ready, it joins the ready queue. When the current running process finishes execution, the oldest process in the ready queue is selected to run next (courses.cs.vt.edu). This algorithm simply chooses the process that arrives first and runs it to completion. If two or more processes have the same arrival ...