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

Celý popis

Podrobná bibliografia

Vydané v:	Applied sciences Ročník 10; číslo 15; s. 5134
Hlavní autori:	Mostafa, Samih M., Amano, Hirofumi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.08.2020
Predmet:	Algorithms Classification Clustering CPU scheduling Datasets K-means Operating systems round robin Scheduling Timesharing turnaround time waiting time
ISSN:	2076-3417, 2076-3417
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!