Journal of Electronic Design Technology

CPU Scheduling Algorithm Round Robin with Dynamic Time Quantum

  1. Dr. Amit Kumar Gupta ✉
  2. Shubham Purohit
  3. Dr. Priya Mathur

Abstract

CPU programming in the operating system is one of the basic factors for determining the performance of the multitasking operating system which makes a computer system more productive by changing the CPU between processes. An operating system manages all operations that continuously and consistently manage the available resources provided by the system in an optimal approach. Process planning is the important operating system functionality for process management. The most popular algorithms are First Come First Serve(FCFS), Priority Based Scheduling, Round Robin(RR) and Shortest Job First(SJF). The performance of the programming algorithms depends on minimizing response times, waiting times, response times, changing the context and optimizing CPU usage. Round Robin (RR) programming is mostly used as CPU programming algorithm in the operating system. The efficiency of a multitasking system that includes Round Robin CPU programming is based on selecting the optimal time. In this article, we study a new CPU programming algorithm, set up as DABRR (Dynamic Average Burst Round Robin) and we also elaborated comparison of DABRR through the static Round Robin algorithm. It takes dynamic quantum time in place of the static quantum time used in RR. The results presented in this paper demonstrate the improvement of the algorithm's statistics in terms of average waiting time, average response time.

References (20)

  1. Sohrawordi, Ehasn Ali, Palash Uddin and Mahabub Hossain. (2019); A MODIFIED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM. Int. J. of Adv. Res. 7 (2). 422-429] (ISSN 2320-5407).
  2. Seemakuthi, Saraswathi, Venkat Alekhya Siriki, and E. Laxmi Lydia. "A Review on Various Scheduling Algorithms." International Journal of Scientific & Engineering Research 6.12 (2015): 769-779.
  3. Jain, Shweta, and Saurabh Jain. "A Research Survey and Analysis for CPU Scheduling Algorithms using Probability -Based Study." International Journal of Engineering and Management Research (IJEMR) 5.6 (2015): 628-633.
  4. Indusree, J & B, Prabadevi. (2017). “Enhanced round robin CPU scheduling with burst time based time quantum” . IOP Conference Series: Materials Science and Engineering. 263. 042038. 10.1088/1757-899X/263/4/042038.
  5. Suranauwarat, Sukanya. "A CPU scheduling algorithm simulator." 2007 37th annual frontiers in education conference -global engineering: knowledge without borders, opportunities without passports. IEEE, 2007.
  6. Yadav, Rakesh Kumar, et al. "An improved round robin scheduling algorithm for CPU scheduling." International Journal on Computer Science and Engineering 2.04 (2010): 1064 - 1066.
  7. Rajput, Ishwari Singh, and Deepa Gupta. "A priority based round robin CPU scheduling algorithm for real time systems." International Journal of Innovations in Engineering and Technology 1.3 (2012): 1-11.
  8. Sindhu, M., R. Rajkamal, and P. Vigneshwaran. "An optimum multilevel CPU scheduling algorithm." 2010 Internation al Conference on Advances in Computer Engineering . IEEE, 2010.11.
  9. Weiser, Mark, et al. "Scheduling for reduced CPU energy." Mobile Computing. Springer, Boston, MA, 1994. 449-471.
  10. Qureshi, Imran. "CPU scheduling algorithms: a survey." International Journa l of Advanced Networking and Applications 5.4 (2014): 1968.
  11. Behera, Himansu Sekhar, Rakesh Mohanty, and Debashree Nayak. "A new proposed dynamic quantum with re-adjusted round robin scheduling algorithm and its performance analysis." arXiv preprint arXiv:1103.3831 (2011).
  12. Hiranwal, Saroj, and K. C. Roy. "Adaptive round robin scheduling using shortest burst approach based on smart time slice." International Journal of Computer Science and Communication 2.2 (2011): 319-323.
  13. Neetu Goel, R.B. Garg, A Compa rative Study of CPU Scheduling Algorithms, 21 May 2015, IJGIP.
  14. Jain, Shweta, and Saurabh Jain. "A review study on the CPU scheduling algorithms." International Journal of Advanced Research in Computer and Communication Engineering 5.8 (2016): 22-31. CPU Scheduling Algorithm Round Robin with Dynamic Time Quantum Purohit et al. © STM Journals 2021. All Rights Reserved 38
  15. Lulla, D., Tayade, J. and Mankar, V. Priority based Round Robin CPU Scheduling using Dynamic Time Quantum. International Journal on Emerging Trends in Technology, September 2015,Vol. 2, No. 2, pp. 358-363.
  16. Banerjee, P., kumar, B., Singh, A., Kumar, R., & k umar, R. (2019). Comparative performance analysis of optimized round robin scheduling(ORR) using dynamic time quantum with round robin scheduling using static time quantum in Real Time System. International Journal of Engineering and Computer Science, 8(12), 24890 –24893. https://doi.org/10.18535/ijecs/v8i12.4399.
  17. Saraswathi Seemakuthi et al, "A Review on Various Scheduling Algorithms", International Journal of Scientific & Engineering Research, Vol. 6, No. 12, Pp. 769-779, December 2015
  18. 18Shweta Jain, Dr. Saurabh Jain , A Review Study on the CPU Scheduling Algorithms , International Journal of Advanced Research in Computer and Communication Engineering, Vol. 5, Issue 8, August 2016.
  19. Indusree, J. R. and Prabadevi, B., “Enhanced round robin CPU scheduling with burst time based time quantum”, in <i>Materials Science and Engineering Conference Series</i>, 2017, vol. 263, no. 4, p. 042038. doi:10.1088/1757-899X/263/4/042038.
  20. Sohrawordi, Ehasn Ali, Palash Uddin and Mahabub Hossain. (2019); A MODIFIED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM. Int. J. of Adv. Res. 7 (Feb). 422-429] (ISSN 2320-5407). www.journalijar.com

Read more of it

Subscribe to one journal or build your own list of several. One invoice, one payment, access for a full year.

Subscribe to journals →

Publish your article

Peer-reviewed journals across every subject, with open access options. Send your manuscript to the right editor today.

Publish with us → Calculate your APC
Support