Finest Round Robin Scheduling Algorithm using Effective Time Quantum
K. Purushotam Naidu, V. V. D. Prasad Chelluri, S. Sumahasan, R.D.D.V. Sivaram · Journal of Software Engineering Tools & Technology Trends · 2020
Scheduling is a most important task of operating-system function. Almost all computer resources are scheduled before use. CPU scheduling is the main task of multi -programmed operating systems. By switching the CPU among processes, the operating system can make the computer more effectively [1]. The CPU is one of the primary computer resources so its scheduling is central to operating-system design. In a simple computer system, the CPU then just sits idle. All this waiting time is wasted, no useful work is accomplished. With multiprogramming, we try to use this time productively. Several processes are kept in memory at one time. When one process has to wait, the operating system takes the CPU away from that process and gives the CPU to another process. Every time one process has to wait, another process can take over use of the CPU. In this paper, we have proposed an Finest Round Robin scheduling algorithm using Effective Time Quantum (FRRETQ) for Efficient CPU Utilization, less average waiting time and turnaround time of each process and minimum number of context switches taken to complete all processes than compare to Simple round robin and Adaptive round robin scheduling algorithms. Keywords : Scheduling, Multiprogramming, Simple round robin, Adaptive round robin, waiting time, Context switch, Turnaround time