Linear Data Model Based Study of Improved Round Robin CPU Scheduling Algorithm

Abstract: One of the main functions of operating system is process management. CPU scheduling plays an important role in getting good performance from the computer system. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. Round Robin CPU scheduling is a choice for the time sharing systems, where the performance of the system depends on the choice of the optimal time quantum. This paper presents a study of improved Round Robin CPU scheduling algorithm which is a combo of the features of Shortest Job First and Round Robin scheduling with varying time quantum. The data model approach has been adapted in analysis with simulation. It is proven that linear increment of the burst time of processes also creates corresponding linear increment in efficiency parameters. The origin shift of the burst time is also directly proportional to the efficiency parameters.

Keywords: CPU Scheduling, Round Robin (RR) Scheduling, Improved Round Robin Scheduling, Shortest Job First (SJF) Scheduling, Burst Time (BT), Waiting Time (WT), Turnaround Time (TT).