Comparison and Analysis of Scheduling Algorithms: Exploring Performance, Time, Fairness, and Applicable Scenarios

Wei Pan

doi:10.54097/4asdtt07

Authors

Wei Pan

DOI:

https://doi.org/10.54097/4asdtt07

Keywords:

CPU scheduling algorithm, waiting time, batch system, real-time system.

Abstract

Scheduling algorithm is an important part of CPU work and plays a key role in the program system. Successful scheduling algorithms can effectively improve system efficiency and stability. This paper aims to analyze the characteristics of several scheduling algorithms comparatively through some general criteria to help determine the applicable algorithms in different situations. This paper first introduces the important role of scheduling algorithms. It then discusses and analyzes in detail the complexity of scheduling algorithms, allocation methods, average waiting time, and starvation. Finally, it draws the advantages and disadvantages of different scheduling algorithms through comparison. The types of scheduling algorithms applicable to batch systems and real-time/interactive systems respectively are concluded. The study results provide a theoretical basis for system designers to achieve the optimal utilization of CPU resources in the system. By analyzing and comparing the advantages and disadvantages of different scheduling algorithms, this paper lays a solid foundation for the future research with more scheduling methods.

Downloads

Download data is not yet available.

References

[1] H. Arora, D. Arora, B. Goel and P. Jain, An Improved CPU Scheduling Algorithm, International Journal of Applied Information Systems (IJAIS),2013, 6, 6, 7.

[2] McGuire C, Lee J. Comparisons of improved round robin algorithms[C]//Proceedings of the World Congress on Engineering and Computer Science. 2014, 1: 158-161.

[3] Bandarupalli S B, Nutulapati N P, Varma P S. A Novel CPU Scheduling Algorithm–Preemptive & Non-Preemptive. International Journal of Modern Engineering Research (IJMER), 2012, 2(6): 4484-4490.

[4] Raheja S, Dadhich R, Rajpal S. Designing of vague logic based multilevel feedback queue scheduler. Egyptian Informatics Journal, 2016, 17(1): 125-137.

[5] Sharma C, Sharma S, Kautish S, et al. A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time. Alexandria Engineering Journal, 2022, 61(12): 10527-10538.

[6] Omar H K, Jihad K H, Hussein S F. Comparative analysis of the essential CPU scheduling algorithms. Bulletin of Electrical Engineering and Informatics, 2021, 10(5): 2742-2750.

[7] Liu C L, Layland J W. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM), 1973, 20(1): 46-61.

[8] Tanenbaum A. Modern operating systems[M]. Pearson Education, Inc., 2009.

[9] McCann C, Vaswani R, Zahorjan J. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 1993, 11(2): 146-178.

[10] Pant A. A Comparison between FCFS and Mixed Scheduling. IJCST, 2011, 2(2): 76-79.

[11] Pemasinghe S, Rajapaksha S. Comparison of CPU scheduling algorithms: FCFS, SJF, SRTF, Round Robin, priority based, and multilevel queuing[C]//2022 IEEE 10th Region 10 Humanitarian Technology Conference (R10-HTC). IEEE, 2022: 318-323.