Comparative Analysis of Multitask Scheduling Algorithms for Reconfigurable Computing Regarding Context Switches and Configuration Cache Usage

2007 ◽  
Author(s):  
Christopher Spies ◽  
Leandro Soares Indrusiak ◽  
Manfred Glesner
Keyword(s):  
Comparative Analysis ◽  
Reconfigurable Computing ◽  
Scheduling Algorithms

scholarly journals Comparative analysis of the essential CPU scheduling algorithms

2021 ◽  
Vol 10 (5) ◽  
pp. 2742-2750
Author(s):  
Hoger K. Omar ◽  
Kamal H. Jihad ◽  
Shalau F. Hussein
Keyword(s):  
Comparative Analysis ◽  
Operating Systems ◽  
Waiting Times ◽  
Stable State ◽  
Scheduling Algorithms ◽  
High Rate ◽  
Cpu Scheduling ◽  
Significant Function ◽  
Cpu Utilization ◽  
Maximum Utilization

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.

Sign in / Sign up

Export Citation Format

Share Document