Finding the optimum parameter values of the round robin CPU scheduling algorithm with genetic algorithm

With the use of computers in every field, the usage intensity of processors is increasing day by day. In order to cope with this intensity, processors need to be constantly updated and improved. Various scheduling algorithms are being developed every day in order to continuously improve and accelerate the processors and to cope with the processing intensity. The main purpose of the scheduling algorithms is to increase the efficiency of the processor. For this, the processor needs to make a planning between the pending processes. Planning can be done by giving different priorities or using different methods. In order to increase the efficiency of the processor, in this paper, existing algorithms were examined. Round Robin Algorithm was improved using Genetic Algorithm. It is aimed to find the optimum values by selecting the quantum value according to the pending processes and their parameters. When the developed new method compared with the existing standard algorithms, it is observed that the waiting time and the turnaround time were shorter than the other algorithms.