Design of Optimal Scheduler for Process Scheduling
Sambath M1, D. John Aravindhar2, P. Harshavardhan Reddy3, Lokesh Kumar Ravipati4, Suthapalli Sai Gowtham5, Korrapati Jagadeesh6, Vemula Raviteja7

1Sambath M*, Assistant Professor,
2Dr. D. John Aravindhar, Professor.
3P. Harshavardhan Reddy, UG Scholar.
4Lokesh kumar Ravipati, UG Scholar.
5Suthapalli sai gowtham, UG Scholar.
6Korrapati Jagadeesh, UG Scholar.
7Vemula Raviteja, UG Scholar, Department of Computer Science & Engineering, Hindustan Institute of Technoogy and Science, Chennai, India.
Manuscript received on January 24, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 29, 2020. | PP: 3759-3761 | Volume-9 Issue-3, February 2020. | Retrieval Number:  C6416029320/2020©BEIESP | DOI: 10.35940/ijeat.C6416.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: UCPU Scheduling takes plays an important role in multiprogramming systems. There are several programs present in memory. It is the responsibility of operating systems to select the process and assign it to CPU. There are various algorithms available for CPU Scheduling. The algorithm’s performance depends on various factors like arrival time, priority etc. This paper helps to select the best algorithm by comparing various algorithms under the same condition and analyzed them based on various factors like waiting time, turnaround time, CPU utilization, Throughput.
Keywords: Scheduler, throughput, turnaround time