Simulation of CPU Scheduling Algorithms for Efficient Execution of Processes

In this paper, our main objective is to study, implement and compare different scheduling algorithms which is very important in increasing the Central Processing Unit’s efficiency. There are a total of 8 algorithms that are opted for the study. They are First Come First Serve (FCFS), Priority Scheduling (PP), Shortest Job First (SJF), Longest Remaining Job First (LRJF), Longest Job First (LJF), Shortest Remaining Job First (SRJF), Round Robin (RR), Highest Response Ratio Next (HRRN)). In this work, various parameters have been considered for the comparison of Central Processing Unit scheduling algorithms. In the end, after the comparative analysis, a conclusion is made regarding which algorithm has what qualities and which one can be treated as the best algorithm for Central Processing Unit scheduling. This paper will be helpful to decide the right algorithm for Central Processing Unit scheduling.