International Journal of Modern Education and Computer Science (IJMECS)
IJMECS Vol. 11, No. 10, 8 Oct. 2019
Cover page and Table of Contents: PDF (size: 522KB)
Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm
Full Text (PDF, 522KB), PP.33-40
Views: 0 Downloads: 0
Author(s)
Dipto Biswas
1,*
Md. Samsuddoha
1
Index Terms
Process Scheduling, Time quantum, turn-around-time, waiting-time, context-switching
Abstract
Process scheduling is considered as a momentous and instinct task accomplished by operating system. Round robin is one of the extensively utilized algorithms for scheduling. Various noticeable scheduling algorithms based on round robin strategy have been introduced in last decade. The most sensitive issue of round robin algorithm is time quantum because it determines and controls the time of achieving resources for a process during execution. Different types of approaches are available for determining time quantum related to round robin. This paper represents a new round robin algorithm having proficient time quantum that has been determined by considering the maximum difference among differences of adjacent consecutive processes into the ready queue. The proposed methodology is an endeavor to increase the outcomes of round robin as well as system performance. The algorithm is experimentally and comparatively better than the mentioned round robin algorithms in this paper. From the consideration against the referred algorithms, it decreases average turn-around-time, average waiting-time and the number of context-switching along with other CPU scheduling criteria.
Cite This Paper
Dipto Biswas, Md. Samsuddoha, " Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm", International Journal of Modern Education and Computer Science(IJMECS), Vol.11, No.10, pp. 33-40, 2019. DOI:10.5815/ijmecs.2019.10.04
Reference
[1]Silberschatz, Abraham, Greg Gagne, and Peter B. Galvin. Operating system concepts. Wiley, 2018.
[2]Goel, Neetu, and R. B. Garg. "A comparative study of cpu scheduling algorithms." arXiv preprint arXiv:1307.4165 (2013).
[3]Somani, Jayashree S., and Pooja K. Chhatwani. "Comparative study of different CPU scheduling algorithms." International Journal of Computer Science and Mobile Computing 2 (2013): 310-318.
[4]Yadav, Rakesh Kumar, et al. "An improved round robin scheduling algorithm for CPU scheduling." International Journal on Computer Science and Engineering 2.04 (2010): 1064-1066.
[5]Mishra, Manish Kumar. "An improved round robin CPU scheduling algorithm." Journal of Global Research in computer science 3.6 (2012): 64-69.
[6]Verma, Rishi, Sunny Mittal, and Vikram Singh. "A Round Robin Algorithm using Mode Dispersion for Effective Measure." International Journal for Research in Applied Science and Engineering Technology (IJRASET) (2014): 166-174.
[7]Goel, Neetu, and R. B. Garg. "Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm." arXiv preprint arXiv:1309.3096 (2013).
[8]Alsheikhy, Ahmed, Reda Ammar, and Raafat Elfouly. "An improved dynamic Round Robin scheduling algorithm based on a variant quantum time." Computer Engineering Conference (ICENCO), 2015 11th International. IEEE, 2015.
[9]Fataniya, Bhavin, and Manoj Patel. "Dynamic Time Quantum Approach to Improve Round Robin Scheduling Algorithm in Cloud Environment." (2018).
[10]Singh, Ajit, Priyanka Goyal, and Sahil Batra. "An optimized round robin scheduling algorithm for CPU scheduling." International Journal on Computer Science and Engineering 2.07 (2010): 2383-2385.
[11]Behera, Himansu Sekhar, Rakesh Mohanty, and Debashree Nayak. "A new proposed dynamic quantum with re-adjusted round robin scheduling algorithm and its performance analysis." arXiv preprint arXiv:1103.3831 (2011).
[12]Noon, Abbas, Ali Kalakech, and Seifedine Kadry. "A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average." arXiv preprint arXiv:1111.5348 (2011).
[13]Ramakrishna, M., and G. Pattabhi Rama Rao. "Efficient Round Robin CPU Scheduling Algorithm for Operating Systems." International Journal of Innovative Technology And Research Volume 1 (2013): 103-109.
[14]Manish Kumar Mishra, Dr. Faizur Rashid (2014) “An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum”, International Journal of Computer Science, Engineering and Applications (IJCSEA), pp 1-8.
[15]Schopf, Lingyun Yang Jennifer M., and Ian Foster. "Conservative Scheduling: Using predictive variance to improve scheduling decisions in Dynamic Environments." Super Computing. 2003.
[16]Dash, Amar Ranjan, and Sanjay Kumar Samantra. "An optimized round Robin CPU scheduling algorithm with dynamic time quantum." arXiv preprint arXiv:1605.00362(2016).
[17]Silberschatz, Abraham, Greg Gagne, and Peter B. Galvin. Operating system concepts. Wiley, 2018.
[18]Matarneh, Rami J. "Self-adjustment time quantum in round robin algorithm depending on burst time of the now running processes." American Journal of Applied Sciences 6.10 (2009): 1831.
[19]Mohanty, Rakesh, et al. "Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time systems." arXiv preprint arXiv:1105.1736 (2011).
[20]Mohanty, Rakesh, et al. "Design and performance evaluation of a new proposed shortest remaining burst round robin (SRBRR) scheduling algorithm." Proceedings of International Symposium on Computer Engineering & Technology (ISCET). Vol. 17. 2010.
[21]Rakesh Mohanty, H. S. Behera, Debashree Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis”, International Journal of Computer Applications (0975 – 8887), Volume 5– No.5, August 2010.