Finest Round Robin Scheduling Algorithm using Effective Time Quantum
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 . 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
Silberschatz A., Galvin P.B., Gagne G., Operating Systems Concepts. 7th Edn. John Wiley and Sons, USA: 2004, ISBN: 13: 978–0471694663, 944p.
Tanebaun A.S., Modern Operating Systems. 3rd Edn. Prentice Hall, 2008, ISBN: 13:9780136006633, 1104p.
Tarek Helmy, Abdelkader Dekdouk, Burst Round Robin: As a Proportional-Share Scheduling Algorithm, IEEE Proceedings of the fourth IEEE-GCC Conference on towards Techno-Industrial Innovations, 424–428p, 11-14 November,2007.
Yashuwanth C & R. Ramesh, Intelligent Time Slice for Round Robin in Real Time Operating System, IJRRAS, February 2010; 2(2): 126–131p.
Rami J. Matarneh, Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the now Running Processes, Department of Management Information Systems, Am. J. Appl. Sci. 2009; 6(10): 1831–1837p, ISSN 1546–9239p.
Helmy T., Dekdouk A., Burst Round Robin: As a Proportional-Share Scheduling Algorithm, IEEE, Proceedings of the fourth IEEE-GCC Conference on towards Techno-Industrial Innovations, 2007, 424–428p.
Shreedhar M., Varghese G., Efficient Fair Queuing using Deficit Round Robin. ACM SIGCOMM Computer Communication Review, October 1995; 25(4): 231p. Doi: 10.1145/21739.
Tong W., Zhao J., Quantum Varying Deficit Round Robin Scheduling over Priority Queues. Proceedings of the International Conference on Computational Intelligence and Security, Dec. 15- 19, Computer Society, Harbin, China, 2007, 252–256p.
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/