期刊名称：International Journal of Advances in Engineering and Management
电子版ISSN：2395-5252
出版年度：2020
卷号：2
期号：10
页码：7-11
DOI：10.35629/5252-0209788791
语种：English
出版社：IJAEM JOURNAL
摘要：In the operating system, Scheduling of CPU plays a vital role in designing. The main objective of our project is to compare different types of algorithms like First Come First Served Scheduling, Shortest Job First Scheduling, Priority Scheduling, Round Robin Scheduling, which helps us to improve the CPU efficiency and Timesharing in the operating system. This paper depicts the study of various scheduling algorithms for a CPU with the help of the Gantt chart. Why CPU scheduling? In the uni-programming systems, when a process waits for an I/O operation, the CPU remains idle. This is an overhead and it wastes the time and causes the problem of starvation. However, In Multiprogramming systems, the CPU doesn't remain idle during the waiting time of the Process and it executes other processes. In Multiprogramming systems, the Operating system schedules the processes of the CPU to make maximum utilization of it and this is called CPU scheduling. The Operating System uses various scheduling algorithm to schedule the processes of the CPU. The short-term scheduler schedules the task of CPU for the number of processes present in the Job Pool. Whenever the running process requests some I/O operation then the short-term scheduler saves the present context of the method called PCB and changes its state from running to waiting. Now the process is in waiting state; the Short-term scheduler picks another process from the ready queue and assigns the CPU to the present process. This procedure is named context switching. In Multiprogramming, if the long-term scheduler has more I/O bound processes then most of the time, the CPU remains idle. The task of OS is to optimize the use of resources. If most of the running processes change their state from running to waiting then there could also be an opportunity of deadlock within the system. Hence to scale back this overhead, the OS must schedule the roles to urge the optimal utilization of CPU and to avoid the likelihood to deadlock.
