An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

作     者：Samih M.Mostafa Hirofumi Amano 

作者机构：Faculty of Computers and InformationSouth Valley UniversityQena83523Egypt Research Institute for Information TechnologyKyushu UniversityFukuoka819-0395Japan 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2021年第66卷第3期

页      面：3253-3270页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Clustering CPU scheduling round robin turnaround time waiting time 

摘      要：CPU scheduling is the basic task within any time-shared operating *** of the main goals of the researchers interested in CPU scheduling is minimizing time *** 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 *** Robin(RR)algorithm is the most common preemptive scheduling algorithm used in the time-shared operating *** 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 *** process has a weight proportional to the weights of all *** process’s weight determines its time slice within the current *** 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 *** experiments showed that the proposed algorithm gives better results.