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

Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 98 - Number 21
Year of Publication: 2014
Authors:
Aashna Bisht
Mohd Abdul Ahad
Sielvie Sharma
10.5120/17307-7760

Aashna Bisht, Mohd Abdul Ahad and Sielvie Sharma. Article: Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm. International Journal of Computer Applications 98(21):20-27, July 2014. Full text available. BibTeX

@article{key:article,
	author = {Aashna Bisht and Mohd Abdul Ahad and Sielvie Sharma},
	title = {Article: Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {98},
	number = {21},
	pages = {20-27},
	month = {July},
	note = {Full text available}
}

Abstract

Process scheduling using Round Robin Algorithm makes use of a fixed amount of time quantum that is assigned to each process to complete its execution. If the process is able to complete its execution within this time period, it is discarded from the ready queue otherwise it goes back to the rear of the ready queue and waits for its next turn. In this paper we have presented amelioration to the conventional round robin algorithm by evaluating the time quantum on the basis of the burst times of the various processes waiting in the ready queue. The allocation of dynamic time quantum to various processes will have a direct impact on various performance parameters like turnaround time, waiting time, response time and the number of context switches. Further we are increasing the time quantum for the processes which require a fractional more time to complete their execution than the allocated time quantum cycle(s).

References

  • Nayana Kundargi,Sheetal Bandekar,"CPU Scheduling Algorithm Using Time Quantum For Batch System",International Journal Of Latest Trends In Engeneering And Technology(IJLTET), special Issue- IDEAS 2013.
  • Himanshi Arora,Deepanshu Arora,Bagish Goel,Parita Jain,"An Improved Scheduling Algorithm",International Journal of applied Information Systems(IJAIS), Foundation of Computer Science FCS, New York, USA, Volume 6– No. 6, December 2013, pp 7- 9.
  • Sandeep Negi,"An Improved Round Robin Approach Using Dyanamic Time Quantum For Improving Average Waiting Time",International Of Computer Applications, Volume 69– No. 14, May 2013, pp 12-16 .
  • Rakesh Patel,Mrs. Mili. Patel," SJRR CPU Scheduling Algorithm "International journal of Engineering And Computer Science. Volume 2 Issue 12, Dec. 2013 Pp: 3396-3399
  • Adeeba Jamal,Aiman Jubair" A Varied Round Robin Approach Using Harmonic Mean Of The Remaining Burst Time Of Processes", Special Issue of International Journal of Computer Applications (0975 – 8887), 3rd International IT Summit Confluence 2012 - Pp 11- 17 .
  • Mohd Abdul Ahad,"Modyfying Round Robin Algorithm For Process Scheduling Using Dynamic Quantum Precision", Special Issue Of International Journal of Computer Applications On Issues AND Challenges In Networking ,Intelligence And Computing Technologies, ICNICT 2012, November 2012, Pp 5-10.
  • C. Yaashuwanth, Dr. R. Ramesh, A New Scheduling Algorithms for Real Time Tasks, (IJCSIS) International Journal of Computer Science and Information Security, Vol. 6, No. 2, 2009, Pp: 61-66
  • Bashir Alam, Fuzzy Round Robin CPU Scheduling Algorithm, Journal of Computer Science, 9(8) : 1079- 1085, 2013© 2013 Science Publications.
  • Lalit Kishor, Dinesh Goyal, Time Quantum Based Improved Scheduling Algorithm, Vol 3 , Issue International Journal of Advanced Research in Computer Science and Software Engineering. 4, April, 2013
  • P. Surendra Varma, A Best possible time quantum for Improving Shortest Remaining Burst Round Robin (SRBRR) Algorithm, International Journal of Advanced Research in Computer Science and software Engineering, Volume 2, Issue 11, ISSN: 2277 128X , November 2012.
  • Silberschatz, A. P. B. Galvin and G. Gagne (2012), Operating System Concepts, 8th edition, Wiley India
  • Operating Systems Sibsankar Haldar 2009, Pearson.
  • D. M. Dhamdhere operating Systems A Concept Based Approach, Second edition, Tata McGraw-Hill, 2006.
  • Sanjaya Kumar Panda, Sourav Kumar Bhoi, An Effective Round Robin Algorithm using Min-Max Dispersion Measure, IJCSE, Vol. 4 No. 01, pp: 45-53 January 2012
  • Prof. Bob Walker, Kathryn McKinley, Bradley Chen, Michael Rosenblum, Tom Anderson, John Ousterhout, Paul Farrell/Steve Chapin Operating system lectures notes http://www. cs. kent. edu/~farrell/osf03/ oldnotes/L06. pdf
  • Aashna Bisht, Mohd Abdul Ahad, Sielvie Sharma, "Enhanced Round Robin Algorithm for Process Scheduling using varying quantum precision" ,Proceedings of ICRIEST AICEEMCS, 29th December, 2013. pp 11-15.
  • R. N. D. S. S Kiran, Polinati Vinod Babu, B. B. Murali Krishna,Optimizing CPU Scheduling for Real Time Applications Using Mean-Difference Round Robin (MDRR) Algorithm, ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I, Advances in Intelligent Systems and Computing Volume 248, 2014, pp 713-721. Springer International Publishing Switzerland, 2014.
  • M. H. Zahedi, M. Ghazizadeh, M. Naghibzadeh, Fuzzy Round Robin CPU Scheduling (FRRCS) Algorithm, Advances in Computer and Information Sciences and Engineering, 2008, pp 348-353, Publisher Springer Netherlands,
  • Bin Nie, Jianqiang Du, Guoliang Xu, Hongning Liu, Riyue Yu, Quan Wen, A New Operating System Scheduling Algorithm, Advanced Research on Electronic Commerce, Web Application, and Communication, Communications in Computer and Information Science Volume 143, 2011, pp 92-96, Publisher Springer Berlin Heidelberg