c program for srtf cpu scheduling algorithm program

There exist a number of scheduling algorithms but Round Robin, Shortest Remaining Time First and the Priority scheduling may have the weightage of the most widely used scheduling algorithms. The users expect fast response and execution, and users’ expectation results in a requirement of least waiting time in execution.

The increment of processes in the system increased the responsibility of CPU scheduler. As many applications worked simultaneously which required many numbers of processes to be created, the processes must be executed in such a manner to provide the better response to users. The use of computer has affected most of the working of our daily life and the use in almost all sort of field has invited a number of applications for every level of users. The CPU plays an important role in implementation of multiprogramming and multitasking. The system is controlled by the multiprogramming and multitasking approach of operating system. After a vast advancement of technology, the cost of hardware get reduced to affordable price and the interest of author turned to fast calculation and response. In the early days, due to the heavy cost of the hardware, the full attention was drawn on the better utilization of resources. Operating System, CPU Scheduling, Priority Scheduling, Turnaround Time, Waiting Time, Response Time, Context Switching We have used the deterministic model to compare the different algorithms. It gives better evaluation results in the form of scheduling criteria. Experiment and comparison show that the VRRP outperforms other CPU scheduling algorithms. The objective is to get all the processes executed with minimum average waiting time and no starvation. For new process, the priority of it becomes equal to inverse of burst time and for the old processes the priority calculation takes place as a ratio of waiting time and remaining burst time. In this scheduling algorithm, the priority is been calculated and the processes with high priority get CPU first or next. In this manuscript, we have proposed a new algorithm Progressively Varying Response Ratio Priority a preemptive CPU scheduling algorithm based on the Priority Algorithm and Shortest Remaining Time First. The world is still waiting for most efficient algorithm which remains a challenging issue.

Many processes in system simultaneously raise a challenging circumstance of man- aging the CPU in such a manner that the CPU utilization and processes execution gets optimal performance. With the increasing number of application, there exist a large number of processes in the computer system at the same time. In present era, one of the most important resources of computer machine is CPU. Received 14 March 2015 accepted 13 April 2015 published 14 April 2015 This work is licensed under the Creative Commons Attribution International License (CC BY). School of Informatics, IOT, Hawassa University, Awassa, EthiopiaĮmail: © 2015 by authors and Scientific Research Publishing Inc.

C program for srtf cpu scheduling algorithm program