Abstract
CPU scheduling is defined as scheduling multiple processes that are required to be executed in a specific time period. A large number of scheduling algorithms have been proposed to achieve maximum CPU utilization/throughput and minimizing turn around, waiting and response time. Existing studies claim that Round Robin (RR) is providing best results in terms of above-mentioned factors. In RR, a process is assigned to CPU for a fixed time quantum then the process starts its execution, in case that assigned time quantum greater than CPU’s capacity then remaining section of that process waits for its next turn. Although RR schedules processes in an efficient manner, however, it has certain limitations such as if time quantum is too small or large, it causes frequent context switching and response time can increase. To address these identified problems, various improved versions of RR also exist. The purpose of this paper is twofold: 1) a comparison between different improved versions of RR; and 2) a new algorithm named Ordering Divisional Scheduling Algorithm (ODSA) is also proposed that combines various features of different algorithms and is actually an improvement to RR. Our results show that ODSA can schedule processes with less turn around and average waiting time as compared to existing solutions.
Highlights
Operating System (OS) is an essential part of a computer system that acts as an intermediary between input commands and hardware
Turnaround time of a process is defined as the time a process has to wait for getting its turn so that its remaining execution can be completed and the waiting time of a process is the time it has to wait in queue before going into execution mode
Process scheduling is important in a multiprogramming environment
Summary
Operating System (OS) is an essential part of a computer system that acts as an intermediary between input commands and hardware. Required execution time is totally dependent on the type of process to be executed; it may fall into the category of engaging CPU’s resources for a long time or either short. In the context where multiple processes are available in the ready state against only one CPU than OS has to decide which process needs to be executed first For this purpose, many scheduling algorithms have been proposed and this management of ordering processes is known as process scheduling [1]. Many scheduling algorithms have been proposed and this management of ordering processes is known as process scheduling [1] These proposed algorithms have been designed with various goals such as better utilization of CPU’s resources, less turnaround time, waiting and response time of processes
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
