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...
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 |
Similar Items
-
A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time
by: Sakshi, et al.
Published: (2022-12-01) -
Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum
by: ِAbdulnasir Ahmad
Published: (2022-12-01) -
Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model
by: Alaa Fiad, et al.
Published: (2020-08-01) -
Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation
by: Chang, Jan Voon, et al.
Published: (2016) -
An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms
by: Abdulnasir Y. Ahmad
Published: (2023-06-01)