18Feb 2019

A MODIFIED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM.

  • Department of Computer Science and Engineering, Hajee Mohammad Danesh Science and Technology University, Dinajpur-5200, Bangladesh.
  • Department of Electronics and Communication Engineering, Hajee Mohammad Danesh Science and Technology University, Dinajpur-5200, Bangladesh.
Crossref Cited-by Linking logo
  • Abstract
  • Keywords
  • References
  • Cite This Article as
  • Corresponding Author

CPU scheduling is one of the basic factors for performance measure of multitasking operating system which makes a commuter system more productive by switching the CPU among the processes. The performance of the CPU scheduling algorithms depends on minimizing waiting time, response time, turnaround time and context switching, and maximizing CPU utilization. Round Robin (RR) is the most widely used CPU scheduling algorithm in multitasking operating system. The efficiency of a multitasking systemcomprising with Round Robin CPU scheduling relies onthe selection of the optimal time quantum. If the time quantum is longer, the response time of the processes becomes too high. On the other hand, the shorter time quantum raises the amount of context switch among the processes. In this paper, a modified CPU scheduling algorithm, called Round Robin with Dynamic Time Quantum (RRDTQ) is introduced for enhancing CPU performance using dynamic time quantum with RR. This time quantum is calculated from the burst time of the set of waiting processes in the ready queue. The experimental results show that the proposed algorithm solves the fixed time quantum problem and decreases the average waiting time and turnaround time compared to traditional RR algorithm.


  1. Banerjee, P., Shree, R., and Verma, R. K. (2017): Generic Round Robin Scheduling for Real Time Systems, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 7, Issue 5, pp. 148-155.
  2. Behera, H. S., Patel, S. and Panda, B. (2011): A new dynamic Round-robin and SRTN algorithm using variable original time slice and dynamic intelligent time slice for soft real time system, International Journal of Computer Applications, Vol. 2, No.1, pp. 54-60.
  3. Goyal, L.K.D, Singh, R., and Sharma, P. (2011): Optimized Scheduling Algorithm, International Conference on Computer Communication and Networks CSI- COMNET-2011, Proceedings published by International Journal of Computer Applications, pp.106-109.
  4. Hiranwal, S and Roy, k. C. (2011): Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice, International Journal of Computer Science and Communication, Vol. 2, No. 2, pp. 319-323.
  5. Mishra, M. K. and Khan, A. K. (2012): An Improved Round Robin CPU Scheduling Algorithm, Journal of Global Research in Computer Science, Vol. 3, No. 6, pp. 64-69.
  6. Mishra, M.K., and Rashid, F. (2014):AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH VARYING TIME QUANTUM, International Journal of Computer Science, Engineering and Applications (IJCSEA), Volume 4, No. 4, pp. 1-8, 2014.
  7. Nayak, D, Malla, S, K. and Debadarshini, D. (2012): Improved Round Robin Scheduling using Dynamic Time Quantum, International Journal of Computer Applications, Vol. 38, No. 5, pp. 34-38.
  8. Nitu, A. M., Uddin, M. P., Islam, M. M., and Islam, M. S. (2015): Developing a Simple, Interactive and Easy Simulation Tool for the Teachers/Undergrad Students with a view to Teaching/Learning CPU Scheduling Algorithms, Institutional Engineering and Technology (IET), Volume 5, No. 1, pp. 25-29.
  9. Noon, A, Kalakech, A. and Kadry, S. (2011): A New Round Robin based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average, International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, pp. 224-229.
  10. Padhy, C., and Nayak, D. R. (2014); Revamped Round Robin Scheduling Algorithm, Journal of Engineering Computers & Applied Sciences (JECAS), Volume 3, No.4, pp.51-59.
  11. Roy, A. C., Mamun, M. A. A., Hossin, K, Islam, M. A, Uddin, M. P, Afjal, M. I. and Sohrawordi, M. (2017): Developing Operating System Simulation Software for Windows Based System by C# .NET Framework and an Android Application by JAVA and XML, Journal of Operating Systems Development & Trends, Volume 4, No. 1, pp. 9?18.
  12. Silberschatz, A., Galvin, P. B., and Gagne, G. (2005): Operating System Concepts, 7th Edition, John Wiley and Sons Inc.
  13. Yadav, R.K., Mishra, A.K., Prakash, N and Sharma, H. (2010): An Improved Round Robin Scheduling Algorithm for CPU Scheduling, International Journal on Computer Science and Engineering, Vol. 2, No. 4, pp. 1064-1066.
  14. Yang, L., Schopf, J.M. and Foster, I. (2003): Conservative Scheduling: Using predictive variance to improve scheduling decisions in Dynamic Environments, Super Computing, Phoenix, AZ, USA.

[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


Md. Sohrawordi
Department of Computer Science and Engineering, Hajee Mohammad Danesh Science and Technology University, Dinajpur-5200, Bangladesh

DOI:


Article DOI: 10.21474/IJAR01/8506      
DOI URL: http://dx.doi.org/10.21474/IJAR01/8506