Dept. of CSE, Khwaja Moinuddin Chishti Language University, Lucknow, Uttar Pradesh, India
*Corresponding Author: irshadkhan05.234@gmail.com, 6306655471
Online published on 14 February, 2025.
The two CPU scheduling algorithms that received the majority of our attention in this paper after reviewing a variety of CPU scheduling algorithms were the shortest job first and priority scheduling algorithms, as well as an improved priority scheduling algorithm that performs better than current scheduling algorithms. Scheduling is the process of assigning tasks to the CPU to optimize use. Because the CPU is the most important resource in a computer system, numerous scheduling approaches aim to maximize its use. The purpose of this study is to explore the CPU scheduler's construction of high-quality scheduling algorithms that meet the scheduling objectives and to study the performance of a multilevel scheduling algorithm that combines two scheduling algorithms.
CPU scheduling, Scheduler, Exponential Averaging, Burst time, Waiting time, Turnaround time