A Review on New Multilevel Scheduling Algorithm and SJF and Priority Scheduling Algorithms

Irshad Khan¹ , Mohd Owais² , Saima Aleem³ , Tasleem Jamal⁴

¹ Dept. of CSE Khwaja Moinuddin Chishti Language University, Lucknow, UP, India .
² Dept. of CSE Khwaja Moinuddin Chishti Language University, Lucknow, UP, India .
³ Dept. of CSE Khwaja Moinuddin Chishti Language University, Lucknow, UP, India .
⁴ Dept. of CSE Khwaja Moinuddin Chishti Language University, Lucknow, UP, India.

Section:Review Paper, Product Type: Journal
Vol.11 , Issue.6 , pp.1-8, Dec-2023

Online published on Dec 31, 2023

Copyright © Irshad Khan, Mohd Owais, Saima Aleem, Tasleem Jamal . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

96 Views    363 Downloads    56 Downloads

Abstract :
The two CPU scheduling algorithms that received the majority of our attention in this paper after reviewing a variety of CPU scheduling algorithms were the shortest job first and priority scheduling algorithms, as well as an improved priority scheduling algorithm that performs better than current scheduling algorithms. Scheduling is the process of assigning tasks to the CPU to optimize use. Because the CPU is the most important resource in a computer system, numerous scheduling approaches aim to maximize its use. The purpose of this study is to explore the CPU scheduler`s construction of high-quality scheduling algorithms that meet the scheduling objectives and to study the performance of a multilevel scheduling algorithm that combines two scheduling algorithms.

Key-Words / Index Term :
CPU scheduling, Scheduler, Exponential Averaging, burst time, waiting time, turnaround time

References :
[1] D. Goyal, “Comparative Analysis of Various Scheduling Algorithms,� International Journal of Advanced Research in Computer Engineering & Technology, Volume 2, Issue 4, pp. 1488-1491,2013
[2] Sonia Zouaoui, Lotfi Boussaid, Abdellatif Mtibaa, “Priority-based round robin (PBRR) CPU scheduling algorithm�, International Journal of Electrical and Computer Engineering (IJECE) Vol. 9, No. 1, February 2019, pp. 190~202
[3] C. Shekar, Karthik, “Analysis of Priority Scheduling Algorithm based on FCFS & SJF for Similar Priority Jobs [1],� pp.1-4,2017.
[4] P. Surendra Varma, “A FINEST TIME QUANTUM FOR IMPROVING SHORTEST REMAINING BURST ROUND ROBIN (SRBRR) ALGORITHM,� Journal of Global Research in Computer Science, Volume 4, No.3, pp.10-15,2013.
[5] O. Hani, M. Dorgham, “Improved Round Robin Algorithm: Proposed Method to Apply SJF using Geometric Mean� International Journal of Computer Science and Mobile Computing, Vol. 5, Iss. 11, pp. 112-119,2016.
[6] A. Alsheikhy, R. Ammar, and R. Elfouly, “An improved dynamic Round Robin scheduling algorithm based on a variant quantum time,� In the Proceedings of the 2015 11th International Computer Engineering Conference, Egypt, pp.98-104, 2015
[7] S. Elmougy, S. Sarhan, and M. Joundy, “A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique,� Journal of Cloud Computing, vol. 6, no. 1, Dec. 2017
[8] G. Siva Nageswara Rao, R. Jayaraman, and S. V. N. Srinivasu, “Efficient PIMRR algorithm based on scheduling measures for improving real Time systems,� International Journal of Engineering and Technology(UAE), vol. 7, no. 2.32 Special Issue 32, pp.275–278, 2018
[9] M. R. Khan and G. Kakhani, “Analysis of Priority Scheduling Algorithm on the Basis of FCFS & SJF for Similar Priority Jobs,� International Journal of Computer Science and Mobile Computing, Vol. 4, Issue. 9, pp.324 – 331, 2015.
[10] M. M. Rashid, M. N. Akhtar, “A new multilevel CPU Scheduling algorithm,� Journal of Applied Sciences, vol. 6, no. 9, pp. 2036-2039, 2006.
[11] J. Lee and K. G. Shin, “Preempt a job or not in EDF scheduling of uniprocessor systems,� IEEE Trans. Comput, vol. 63, no. 5, pp.1197–1206, 2014
[12] O. Hani and M. Dorgham “Improved Round Robin Algorithm?: Proposed Method to Apply SJF using Geometric Mean� in the proceedings of 2019 2nd International Conference on Computer Applications & Information Security, vol. 5, no. 11, pp. 112–120, 2016.
[13] S. Saeidi “Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method�, I.J. Information Technology and Computer Science, vol. 4, pp. 67–73, 2012.
[14] S. Banerjee, A. Chowdhury, S. Mukherjee, and U. Biswas “An Approach Towards Development of a New Cloudlet Allocation Policy with Dynamic Time Quantum� Aut. Control Comp. Sci., vol. 52, no. 3, pp. 208–219, 2018.