Call for Paper - September 2020 Edition
IJCA solicits original research papers for the September 2020 Edition. Last date of manuscript submission is August 20, 2020. Read More

Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Yosef Berhanu, Abebe Alemu, Manish Kumar Mishra
10.5120/ijca2017914569

Yosef Berhanu, Abebe Alemu and Manish Kumar Mishra. Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm. International Journal of Computer Applications 167(13):48-55, June 2017. BibTeX

@article{10.5120/ijca2017914569,
	author = {Yosef Berhanu and Abebe Alemu and Manish Kumar Mishra},
	title = {Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {June 2017},
	volume = {167},
	number = {13},
	month = {Jun},
	year = {2017},
	issn = {0975-8887},
	pages = {48-55},
	numpages = {8},
	url = {http://www.ijcaonline.org/archives/volume167/number13/27835-2017914569},
	doi = {10.5120/ijca2017914569},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

In multiprogramming environment, CPU scheduling is the process to determine the most efficient way to service the requests of the processes waiting in the ready queue to be executed. The CPU scheduling algorithms focus on maximizing CPU utilization by minimizing waiting time, turnaround time and number of context switches for a set of processes. In time shared systems the preferred choice is Round Robin (RR) CPU scheduling in which performance of the system depends on the choice of the time quantum. This paper presents a dynamic time quantum based Round Robin CPU scheduling algorithm to enhance the CPU performance using the features of an Improved Round Robin (IRR) and an improved Round Robin CPU scheduling algorithm with varying time quantum (IRRVQ). The experimental and simulation results show that the proposed algorithm is proven better than the RR, IRR and IRRVQ in terms of decreasing the average waiting time, average turnaround time and number of context switches.

References

  1. R. K. Yadav, A. K. Mishra, N. Prakash, and H. Sharma, “An Improved Round Robin Schedduling Algorithm for CPU Scheduling”, International Journal on Computer Science and Engineering, Vol. 2, No. 4, 2010, 1064-1066.
  2. Silberschatz, A., Galvin, P. B., and Gagne, G. 2005. Operating System Concepts. John Wiley and Sons Inc.
  3. M. K. Mishra, and A. K. Khan, “An Improved Round Robin CPU Scheduling Algorithm”, Journal of Global Research in Computer Science, Vol. 3, No. 6, 2012, 64-69.
  4. M. K. Mishra, and F. Rashid, “An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum”, International Journal of Computer Science, Engineering and Applications (IJCSEA), Vol.4, No.4, 2014, 1-8.
  5. R. J. Matarneh, “Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes”, American J. of Applied Sciences, Vol. 6, No. 10, 2009, 1831-1837.
  6. H. S. Behera, R. Mohanty and D. Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis”, International Journal of Computer Applications, Vol. 5, No. 5, 2010, 10-15.
  7. M. Lavanya, and S. Saravanan, “Robust Quantum Based Low-power Switching Technique to improve System Performance”, International Journal of Engineering and Technology, Vol. 5, No. 4, 2013, 3634-3638.
  8. T. Helmy, and A. Dekdouk, “Burst Round Robin as a Proportional-share Scheduling Algorithm”, IEEEGCC, 2007, Available: http://eprints.kfupm.edu.sa/1462/.
  9. D. Nayak, S. K. Malla, and D. Debadarshini, “Improved Round Robin Scheduling using Dynamic Time Quantum”, International Journal of Computer Applications, Vol. 38, No. 5, 2012, 34-38.
  10. M. Neshat, M. Sargolzaei, A. Najaran, and A. Adeli, “The New method of Adaptive CPU Scheduling using Fonseca and Fleming’s Genetic Algorithm”, Journal of Theoretical and Applied Information Technology, Vol. 37, No. 1, 2012, 1-16.
  11. H. S. Behera, R. Mohanty, J. Panda, D. Thakur, and S. Sahoo, “Experimental Analysis of a New Fare-Share Scheduling Algorithm with Waited Time Slice for Real Time Systems”, Journal of Global Research in Computer Science, Vol. 2, No. 2, 2011, 54-60.
  12. H. S. Behera, S. Patel, and B. Panda, “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, 2011, 54-60.
  13. H. S. Behera, J. Panda, D. Thakur, and S. Sahoo, “A New Proposed Two Processor Based CPU Scheduling Algorithm with Varying Time quantum for Real Time Systems”, Journal of Global Research in Computer Science, Vol. 2, No. 4, 2011, 81-87.
  14. A. Noon, A. Kalakech, and S. Kadry, “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, 2011, 224-229.
  15. M. K. Srivastav, S. Pandey, I. Gahoi, and N. K. Namdev, “Fair Priority Round Robin with Dynamic Time Quantum”, International Journal of Modern Engineering Research, Vol. 2, Issue 3, 2012, 876-881.
  16. A. Abdulrahim, S. Aliyu, A. M. Mustapha, and S. E. Abdullahi, “An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 4, Issue 2, 2014, 601-610.
  17. A. Abdulrahim, S. E. Abdullahi, and J. B. Sahalu, “An New Improved Round Robin (NIRR) CPU Scheduling Algorithm”, International Journal of Computer Applications, Vol. 90, No. 4, 2014, 27-33.
  18. A. R. Dash, S. K. Sahu, and S. K. Samantra, “An Optimized Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum”, International Journal of Computer Science, Engineering and Information Technology, Vol. 5, No. 1, 2015, 7-25.

Keywords

CPU Scheduling, Round Robin, Dynamic Time Quantum, Waiting Time, Turnaround Time