Next Article in Journal
Machine Learning Applied to Diagnosis of Human Diseases: A Systematic Review
Previous Article in Journal
The Effect of a 7-Week Training Period on Changes in Skin NADH Fluorescence in Highly Trained Athletes
Article

Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

1
Computer Science-Mathematics Department, Faculty of Science, South Valley University, Qena 83523, Egypt
2
Research Institute for Information Technology, Kyushu University, Fukuoka 819-0395, Japan
*
Author to whom correspondence should be addressed.
Appl. Sci. 2020, 10(15), 5134; https://doi.org/10.3390/app10155134
Received: 17 June 2020 / Revised: 18 July 2020 / Accepted: 22 July 2020 / Published: 26 July 2020
(This article belongs to the Section Computing and Artificial Intelligence)
Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results. View Full-Text
Keywords: CPU scheduling; round robin; waiting time; turnaround time; K-means CPU scheduling; round robin; waiting time; turnaround time; K-means
Show Figures

Figure 1

MDPI and ACS Style

Mostafa, S.M.; Amano, H. Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique. Appl. Sci. 2020, 10, 5134. https://doi.org/10.3390/app10155134

AMA Style

Mostafa SM, Amano H. Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique. Applied Sciences. 2020; 10(15):5134. https://doi.org/10.3390/app10155134

Chicago/Turabian Style

Mostafa, Samih M., and Hirofumi Amano. 2020. "Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique" Applied Sciences 10, no. 15: 5134. https://doi.org/10.3390/app10155134

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop