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

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 sc...

Full description

Bibliographic Details
Main Authors: Samih M. Mostafa, Hirofumi Amano
Format: Article
Language:English
Published: MDPI AG 2020-07-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/10/15/5134
_version_ 1797561320401272832
author Samih M. Mostafa
Hirofumi Amano
author_facet Samih M. Mostafa
Hirofumi Amano
author_sort Samih M. Mostafa
collection DOAJ
description 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.
first_indexed 2024-03-10T18:12:14Z
format Article
id doaj.art-97ea4164d8d84510b69224b8829bf90c
institution Directory Open Access Journal
issn 2076-3417
language English
last_indexed 2024-03-10T18:12:14Z
publishDate 2020-07-01
publisher MDPI AG
record_format Article
series Applied Sciences
spelling doaj.art-97ea4164d8d84510b69224b8829bf90c2023-11-20T08:00:51ZengMDPI AGApplied Sciences2076-34172020-07-011015513410.3390/app10155134Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering TechniqueSamih M. Mostafa0Hirofumi Amano1Computer Science-Mathematics Department, Faculty of Science, South Valley University, Qena 83523, EgyptResearch Institute for Information Technology, Kyushu University, Fukuoka 819-0395, JapanMinimizing 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.https://www.mdpi.com/2076-3417/10/15/5134CPU schedulinground robinwaiting timeturnaround timeK-means
spellingShingle Samih M. Mostafa
Hirofumi Amano
Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
Applied Sciences
CPU scheduling
round robin
waiting time
turnaround time
K-means
title Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
title_full Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
title_fullStr Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
title_full_unstemmed Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
title_short Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
title_sort dynamic round robin cpu scheduling algorithm based on k means clustering technique
topic CPU scheduling
round robin
waiting time
turnaround time
K-means
url https://www.mdpi.com/2076-3417/10/15/5134
work_keys_str_mv AT samihmmostafa dynamicroundrobincpuschedulingalgorithmbasedonkmeansclusteringtechnique
AT hirofumiamano dynamicroundrobincpuschedulingalgorithmbasedonkmeansclusteringtechnique