Performance Comparison of Scheduling Algorithms for Multimedia Traffic Over High-Rate WPANs

2007 ◽  
Author(s):  
Fabio Lorquando ◽  
Andrea Zanella
Keyword(s):  
Scheduling Algorithms ◽  
Performance Comparison ◽  
High Rate ◽  
Multimedia Traffic

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.

scholarly journals Static vs. Dynamic List-Scheduling Performance Comparison

10.14311/490 ◽  
2003 ◽  
Vol 43 (6) ◽  
Author(s):  
T. Hagras ◽  
J. Janeček
Keyword(s):  
Task Scheduling ◽  
Optimal Solution ◽  
Scheduling Algorithms ◽  
Low Complexity ◽  
Performance Comparison ◽  
List Scheduling ◽  
Scheduling Problem ◽  
Computing Environments ◽  
Np Complete ◽  
List Scheduling Algorithms

The problem of efficient task scheduling is one of the most important and most difficult issues in homogeneous computing environments. Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to have heuristics to find a reasonably good schedule rather than evaluate all possible schedules. List-scheduling is generally accepted as an attractive approach, since it pairs low complexity with good results. List-scheduling algorithms schedule tasks in order of priority. This priority can be computed either statically (before scheduling) or dynamically (during scheduling). This paper presents the characteristics of the two main static and the two main dynamic list-scheduling algorithms. It also compares their performance in dealing with random generated graphs with various characteristics.

Sign in / Sign up

Export Citation Format

Share Document