Samih M. Mostafa1,*, Sahar Ahmed Idris2, Manjit Kaur3
CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 6271-6288, 2022, DOI:10.32604/cmc.2022.021978
Abstract Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable… More >
Login
Register
