A novel intelligent round robin CPU scheduling algorithm

Abstract

In the present era of smart computing and digital transformation multiprogramming multitasking, multi-user operating environment is playing an important role where rapid arrival, termination and switching of multiple processes is crucial for performance. CPU Utilization is one of the key performance parameter and CPU scheduling crucial for CPU utilization. On the way of improving performance, substantial research and efforts are being done by community researchers and operating system processing is becoming fast day by day. Major performance evaluations criteria like waiting time, response time turnaround time number of context switching are sophisticatedly enhanced to achieve better processing. Round-Robin (RR) scheduling is a well-known important scheduling algorithm where quantum time slot pointedly affect performance. In case of very large quantum time it works like First come first serve or if it is too small then RR works like a process sharing algorithm which increases the system overheads in view of context switching. Thus setting up an effective quantum time is a major challenge for researchers. In this work a clustering inspired novel intelligent approach has been proposed to significantly enhance the round robin algorithm performance. An intelligent sub ready queue by using standard deviation and optimal threshold is created. Dynamic quantum is generated for each cluster and performance is evaluated on sample data in terms of waiting time, response time, turnaround time and context switching. The results of the proposed intelligent approach are compared with other existing algorithms and are found better.