Comparison Analysis of CPU Scheduling FCFS, SJF and Round Robin (original) (raw)

Task scheduling is needed to maintain every process that comes with a processor in parallel processing. In several conditions, not every algorithm works better on the significant problem. Sometimes FCFS algorithm is better than the other in short burst time while Round Robin is better for multiple processes in every single time. However, it cannot be predicted what process will come after. Average Waiting Time is a standard measure for giving credit to the scheduling algorithm. Several techniques have been applied to maintain the process to make the CPU performance in normal. The objective of this paper is to compare three algorithms, FCFS, SJF, and Round Robin. The target is to know which algorithm is more suitable for the certain process.