Odsa: A Novel Ordering Divisional Scheduling Algorithm For Modern Operating System
For the success of multiprogramming environment, concept of CPU scheduling contributed more than anything else. It 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 with the intensions of achieving 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 while comparing with other scheduling algorithms. In RR, a process is assignedto 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, it causes frequent context switching and if it is too large the response time can increase. To address these identified problems, various researchers have remarkable contributions. In this research effort, we have analyzed different improvements to RR with the intensions of finding their associated limitations. For this purpose, we have used a sample scenario for which simulations are performed to check results of process scheduling against above mentioned parameters. We have also proposed a new algorithm named Ordering Divisional Scheduling Algorithm (ODSA) 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.
Keywords - Ordering Divisional Scheduling Algorithm (ODSA), Resource Scheduling, Round Robin