Open AccessComparative analysis of the essential CPU scheduling algorithms
Author(s) -
Hoger K. Omar,
Kamal H. Jihad,
Shalau Farhad Hussein
Publication year - 2021
Publication title -
bulletin of electrical engineering and informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 12
ISSN - 2302-9285
DOI - 10.11591/eei.v10i5.2812
Subject(s) - computer science , cpu shielding , fair share scheduling , rate monotonic scheduling , dynamic priority scheduling , central processing unit , two level scheduling , round robin scheduling , earliest deadline first scheduling , computer multitasking , scheduling (production processes) , algorithm , fixed priority pre emptive scheduling , parallel computing , distributed computing , operating system , mathematical optimization , schedule , mathematics
CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state. As well as, CPU scheduling algorithms are the main service in the operating systems that fulfill the maximum utilization of the CPU. This paper aims to compare the characteristics of the CPU scheduling algorithms towards which one is the best algorithm for gaining a higher CPU utilization. The comparison has been done between ten scheduling algorithms with presenting different parameters, such as performance, algorithm’s complexity, algorithm’s problem, average waiting times, algorithm’s advantages-disadvantages, allocation way, etc. The main purpose of the article is to analyze the CPU scheduler in such a way that suits the scheduling goals. However, knowing the algorithm type which is most suitable for a particular situation by showing its full properties.