期刊名称：International Journal of Computer Science, Engineering and Applications (IJCSEA)
印刷版ISSN：2231-0088
电子版ISSN：2230-9616
出版年度：2014
卷号：4
期号：4
DOI：10.5121/ijcsea.2014.4401
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Process management is one of the important tasks performed by the operating system. The performance ofthe system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms isto minimize waiting time, turnaround time, response time and context switching and maximizing CPUutilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, PriorityScheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPUscheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends onthe choice of the optimal time quantum. This paper presents an improved Round Robin CPU schedulingalgorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robinscheduling with varying time quantum. The proposed algorithm is experimentally proven better thanconventional RR. The simulation results show that the waiting time and turnaround time have been reducedin the proposed algorithm compared to traditional RR.
关键词：CPU Scheduling; Round Robin Scheduling; Improved Round Robin Scheduling; Burst Time; Waiting Time;Turnaround Time
