Open Access Open Access  Restricted Access Subscription or Fee Access

Round Robin Scheduling Algorithm using Time Quantum

Aditya Singh


Booking is a most imperative errand of working framework capacity. Pretty much all PC assets are booked before utilization. CPU planning is the principle undertaking of multimodified working frameworks. By exchanging the CPU among courses of action, the working framework can make the PC all the more successfully [1]. The CPU is one of the essential PC assets so its planning is key to working framework plan. In a straight forward PC framework, the CPU then simply sits unmoving. Such a lot of holding up time is squandered, no valuable work is refined. With multiprogramming, we attempt to utilize this time gainfully. A few methods are kept in memory at one time. At the point when one methodology needs to hold up, the working framework detracts the CPU from that process and gives the CPU to an alternate procedure. Each time one procedure needs to hold up, an alternate methodology can assume control utilization of the CPU. In this paper, we have proposed a Finest Round Robin
booking calculation utilizing Effective Time Quantum (FRRETQ) for Efficient CPU
Utilization, less normal holding up time and turnaround time of every procedure and least number of setting switches taken to finish all techniques than contrast with Simple round robin and Adaptive round robin planning calculations.

Keywords: Scheduling, Multiprogramming, Simple round robin, Adaptive round robin, Holding up time, Context switch, Turnaround time

Cite this Article
Himanshu Verma. Round Robin Scheduling Algorithm Using Time Quantum. Journal of Software Engineering Tools & Technology Trends. 2015; 2(1): 22–25p.

Full Text:



Silberschatz A., Galvin P.B., Gagne G., Operating Systems Concepts. 7th Edn. John Wiley and Sons, USA, ISBN: 13: 978-0471694663, 2004, 944p.

Tanebaun A.S., Modern Operating Systems. 3rd Edn. Prentice Hall, ISBN: 13:9780136006633, 2008, 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, 11–14 November, 2007, 424–428p.

Yashuwanth C, Ramesh R., 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-9239.

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; 5(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, 2007, Computer Society, Harbin, China, 252–256p.


  • There are currently no refbacks.

This site has been shifted to