Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Optimal Round Robin CPU Scheduling Algorithm using Euclidean Distance

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 18
Year of Publication: 2014
Authors:
Merwyn D'souza
Fiona Caiero
Suwarna Surlakar
10.5120/16892-6930

Merwyn D’souza, Fiona Caiero and Suwarna Surlakar. Article: Optimal Round Robin CPU Scheduling Algorithm using Euclidean Distance. International Journal of Computer Applications 96(18):8-11, June 2014. Full text available. BibTeX

@article{key:article,
	author = {Merwyn D’souza and Fiona Caiero and Suwarna Surlakar},
	title = {Article: Optimal Round Robin CPU Scheduling Algorithm using Euclidean Distance},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {18},
	pages = {8-11},
	month = {June},
	note = {Full text available}
}

Abstract

The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. This paper describes a new method to calculate the time quantum without user intervention by finding the relationship between the burst times of all processes in the ready queue using a similarity measure known as the Euclidean distance. Similarity measure is used to find patterns in the burst times of processes present in the ready queue.

References

  • Operating System Concepts ,8th Ed. ,Abraham Silberschatz, Peter B. Galvin, Grege Gagne . ISBN 978-81-265-2051-0.
  • Rami J Matarneh. , "Self adjustment time quantum in round robin algorithm depending on burst time of the now running process", American Journal
  • Samih M. Mostafa, S. Z. Rida, Safwat H. Hamad, "Finding time quantum of round robin CPU scheduling, algorithm in general computing systems using integer programming" October 2010, IJRRAS 5 (1)
  • Mohd Abdul Ahad," Modifying round robin algorithm for process scheduling using dynamic quantum precision", International Journal of Computer applications(0975-8887) on Issues and Challenges in Networking, Intelligence and Computing Technologies- ICNICT 2012.
  • Saroj Hiranwal and Dr. K. C. Roy, " Adaptive round robin scheduling using shortest burst approach based on smart time slice", International Journal of Data Engineering, volume 2, Issue. 3, 2011.
  • Yaashuwanth C. & R. Ramesh, " Intelligent time slice for round robin in real time operating system, IJRRAS 2 (2), February 2010.
  • H. S. Behera, R. Mohanty, Debashree Nayak, "A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and its Performance Analysis", Volume 5-No. 5, August 2010, International Journal of Computer Application(0975-8887)
  • Abbas Noon , Ali Kalakech and Saifedine Kadry, " A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average" IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011.
  • Bashir Alam, "Fuzzy round robin cpu scheduling algorithm", Journal of Computer Science 9 (8): 1079-1085, 2013.
  • Pallab Banerjee, Probal Banerjee and Shweta Sonali Dhal, "Comparative performance analysis of mid average round robin scheduling (MARR) using dynamic time quantum with round robin scheduling algorithm having static time quantum", International Journal of Electronics and Computer Science Engineering, ISSN-2277-1956 2012.
  • Debashree Nayak , Sanjeev Kumar Malla and Debashree Debadarshini, "Improved round robin scheduling using dynamic time quantum", International Journal of Computer Applications (0975-8887) Volume 38- No 5, January 2012.
  • http://en. wikipedia. org/wiki/Euclidean_distance