Published Paper Details:

The more people are getting involved in the technology, faster they want to process things, for faster evaluation of the work good , efficient processors are required. For Optimum Usage of CPU(Central Processing Unit), scheduling of the task is essential. CPU scheduling is the chief task of multi -programmed operating systems. Since Modern working frameworks are being switched from single job environment to multitask environment and technologies like big data ,cloud computing have already boomed up that utilization of resources with traditional scheduling algorithm are not efficient. The purpose of this paper is to introduce a variant of Round Robin algorithm with a new method of calculating Time Quanta also known as time slices. Time Quanta is a fixed amount of time by which number of processes are executed. Here,in this paper time quantum is calculated using mean of Minimum burst time and maximum burst time of the processes. This scheduling method gives a better result than other methods of improved round robin scheduling and traditional Round Robin Scheduling..