• NAVEEN KUMAR
• Gaurav Sharma
• Anunaya Inani

The essential and important aspect of operating system is multiprogramming. Multiprogramming is a process or method of executing multiple processes simultaneously in the memory. Its main aim to minimize the average waiting time, average turnaround time and maximize the CPU utilization. There are various CPU scheduling algorithms are used to performed multiprogramming like First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) and Round Robin(RR).The most widely used scheduling algorithm is Round robin scheduling among all of them. It is an optimal CPU scheduling algorithms in timeshared systems. In round robin algorithm the time quantum is static and the performance of these algorithms is totally depending upon the selection of time quantum. This static time quantum decrease the performance of CPU scheduling like Average waiting time ,average turnaround time and CPU utilization. The objective of this paper is to proposed a new optimized CPU scheduling algorithm which will perform better than the simple Round Robin algorithm in terms of minimizing average waiting time, average turnaround time and number of context switches.

Context switching, CPU scheduling, Gantt chart, Response time, Round Robin CPU scheduling algorithm, Turnaround time, Waiting time

"A NEW OPTIMIZED CPU SCHEDULING ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.453-460, April-2019, Available :http://www.jetir.org/papers/JETIR1904E71.pdf

"A NEW OPTIMIZED CPU SCHEDULING ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp453-460, April-2019, Available at : http://www.jetir.org/papers/JETIR1904E71.pdf