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

Published in:	Applied sciences Vol. 10; no. 15; p. 5134
Main Authors:	Mostafa, Samih M., Amano, Hirofumi
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.08.2020
Subjects:	Algorithms Classification Clustering CPU scheduling Datasets K-means Operating systems round robin Scheduling Timesharing turnaround time waiting time
ISSN:	2076-3417, 2076-3417
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!