An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

• Published in: Computers, materials & continua Vol. 66; no. 3; pp. 3253 - 3270
• Main Authors: M. Mostafa, Samih, Amano, Hirofumi
• Format: Journal Article
• Language: English
• Published: Henderson Tech Science Press 01.01.2021
• Subjects: Algorithms; Clustering; Comparative studies; Design of experiments; Operating systems; Preempting; Scheduling; Switches; Task scheduling; Weight
• ISSN: 1546-2226; 1546-2218; 1546-2226
• DOI: 10.32604/cmc.2021.014675

CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the advantageous of the low scheduling overhead of the RR and favor short process for the sake of minimizing time cost. Each process has a weight proportional to the weights of all processes. The process’s weight determines its time slice within the current period. The authors benefit from the clustering technique in grouping the processes that are similar in their attributes (e.g., CPU service time, weight, allowed time slice (ATS), proportional burst time (PBT) and NCS). Each process in a cluster is assigned the average of the processes’ time slices in this cluster. A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times, and NCS. The experiments showed that the proposed algorithm gives better results.