Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Achieving Stability in the Round Robin Algorithm

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Kamal ElDahshan, Afaf Abd El-kader, Nermeen Ghazy

Kamal ElDahshan, Afaf Abd El-kader and Nermeen Ghazy. Achieving Stability in the Round Robin Algorithm. International Journal of Computer Applications 172(6):15-20, August 2017. BibTeX

	author = {Kamal ElDahshan and Afaf Abd El-kader and Nermeen Ghazy},
	title = {Achieving Stability in the Round Robin Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {August 2017},
	volume = {172},
	number = {6},
	month = {Aug},
	year = {2017},
	issn = {0975-8887},
	pages = {15-20},
	numpages = {6},
	url = {},
	doi = {10.5120/ijca2017915161},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the performance of these algorithms and develops a time quantum that achieves stability in terms of the average waiting time and the average turnaround time.


  1. A. Silberschatz, P. B. Galvin, and G. Gagne, “Operating System Concepts”, (9th Edn. John Wiley and Sons Inc, ISBN 978-1-118-06333-0), 2013.
  2. Sukumar Babu Bandarupalli, Neelima Priyanka Nutulapati, Prof. Dr. P.Suresh Varma, “A Novel CPU Scheduling Algorithm–Preemptive & Non- Preemptive”, International Journal of Modern Engineering Research (IJMER), Vol.2, Issue 6, pp 4484-4490, (Nov-Dec) 2012.
  3. Suri, P.K and Sumit, M, “Design of Stochastic Simulator for Analyzing the Impact of Scalability on CPU Scheduling Algorithms”, International Journal of Computer Applications, Vol.49, Issue 17, pp 4-9, July 2012.
  4. Abdulrazaq Abdulrahim, Salisu Aliyu, Salisu Aliyu, Saleh E Abdullahi, “An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm”, International Journal of Advanced Research in Computer Science and Software Engineering, Volume.4, Issue 2, pp 601-610, February 2014.
  5. Manish K. M. and Abdul Kadir K, “An Improved Round Robin CPU Scheduling Algorithm”, Journal of Global Research in Computer Science, Volume 3, No. 6, pp 64-69, 2012.
  6. Imran Qureshi, “CPU Scheduling Algorithms: A Survey”, Int. J. Advanced Networking and Applications, Vol. 05, Issue 04, pp 1968- 1973, 2014.
  7. Sanjaya Kumar Panda, Sourav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max Dispersion Measure”, International Journal on Computer Science and Engineering (IJCSE), Vol. 4, Issue 01, pp 45-53, January 2012.
  8. Saroj Hiranwal, Dr. K.C. Roy “Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice”, International Journal of Computer Science and Communication, Vol.2, Issue 2, pp 319-323, (July- December) 2011.
  9. Jayanti Khatri, “An Enhanced Round Robin CPU Scheduling Algorithm”, IOSR Journal of Computer Engineering (IOSR-JCE), Vol.18, Issue 4, pp 20-24, Ver. II (Jul-Aug) 2016.
  10. Arpita Sharma1, Mr. Gaurav Kakhani, “Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm”, International Journal of Computer Science and Mobile Computing, Vol.4, Issue.12, pp. 139-147, December- 2015.


Operating Systems, Scheduling Algorithms, Round Robin algorithm, Adaptive Round Robin, Round Robin Remaining Time algorithm, Enriched Round Robin algorithm, Time quantum (TQ), Average Waiting Time, Average Turnaround Time.