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

Improved Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Bakare K. Ayeni, Obiniyi A. Afolayan, Nurat Yusuf
10.5120/ijca2017914305

Bakare K Ayeni, Obiniyi A Afolayan and Nurat Yusuf. Improved Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time. International Journal of Computer Applications 167(7):21-28, June 2017. BibTeX

@article{10.5120/ijca2017914305,
	author = {Bakare K. Ayeni and Obiniyi A. Afolayan and Nurat Yusuf},
	title = {Improved Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time},
	journal = {International Journal of Computer Applications},
	issue_date = {June 2017},
	volume = {167},
	number = {7},
	month = {Jun},
	year = {2017},
	issn = {0975-8887},
	pages = {21-28},
	numpages = {8},
	url = {http://www.ijcaonline.org/archives/volume167/number7/27784-2017914305},
	doi = {10.5120/ijca2017914305},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Round-Robin (RR) is one of the algorithms mostly used in time sharing system and in network scheduling. Time slices are assigned to each process in equal portions and in circular order handling all processes without priority. Round Robin algorithm requires some parameter such as arrival time, burst time and quantum time which enables the scheduler to predict the behavior of possible processes. Prior to the execution of a process, the burst time is not known. This paper proposed a more improvement in the Round Robin CPU scheduling algorithm by improving the algorithm of Anju et. al. where burst time is determined using an initial time quantum. However, the improved algorithm determines burst time using instruction count in each of the process and by experimental analysis. This proposed algorithm performs better than Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time in terms of minimizing average waiting time, average turnaround time and number of context switches.

References

  1. Silberschatz, A., Galvin, P. B. and Gagne, G. 2013. Operating System Concepts. (9th, Ed.) John Wiley and Sons Inc, USA.
  2. Ajit, S, Priyanka, G and Sahil, B. 2010. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling. International Journal on Computer Science and Engineering , 2 (7), 2382-2385
  3. Hamad, S. H., Mostafa, S., and Rida, S. Z. 2010 Finding Time Quantum of Round Robin CPU Scheduling Algorithm in General Computing Systems using Integer Programming. IJRRAS, 5(1) pp 65-70.
  4. Nirvikar And Kumar, N. 2013 Performance Improvement Using CPU Scheduling Algorithm-SRT. International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), (2) 2. Pp 110-113.
  5. Manish, K. M. and Faizur R. 2014 An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum. International Journal of Computer Science, Engineering and Applications (IJCSEA) (4)4.
  6. Abdulrazak, A., Abdullahi, S. E. and Sahalu, J. B. 2014. New Improved Round Robin (NIRR) CPU Scheduling Algorithm. International Journal of Computer Applications (0975 – 8887) Volume 90 – No 4, March 2014.
  7. Anju, M., Neenu, A., and Nandakumar, R 2016. Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time. Indian Journal of Science and Technology, Vol 9(8), pp. 1-6.

Keywords

CPU scheduling algorithm, Average Waiting time, Average Turnaround Time, Number of Context Switches.