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

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:
CPU scheduling
round robin
waiting time
turnaround time
K-means
Online Access:https://www.mdpi.com/2076-3417/10/15/5134

Internet

https://www.mdpi.com/2076-3417/10/15/5134

Similar Items