![]() |
International Journal of Scientific Research and Engineering Development( International Peer Reviewed Open Access Journal ) ISSN [ Online ] : 2581 - 7175 |
IJSRED » Archives » Volume 8 -Issue 5

π Paper Information
π Paper Title | Review on CPU Scheduling Algorithms |
π€ Authors | Prof. Nisha Pawar, Payal Sawade, Sayali Pathare |
π Published Issue | Volume 8 Issue 5 |
π Year of Publication | 2025 |
π Unique Identification Number | IJSRED-V8I5P107 |
π Abstract
CPU scheduling is an important conception in OS, after completion of one process which process will be schedule, scheduling algorithm can be named. While multiple processes are arrive in the system at the same time and CPU get allocated to one of them, depends on the situtions. For CPU scheduling, we use colourful scheduling algorithms like, FCFS (first come first serve), RR (round robin), precedence scheduling, SJF (shortest job first). Which algorithm come stylish for scheduling, depends on the outturn, reversal time, staying time, response time. Understanding the CPU scheduling algorithms and their effect in OS. CPU scheduling come veritably important in OS, without scheduling process canβt execute or complete their prosecutions. This paper presents the style processes are schedule and which algorithm is stylish according to particular situations.