List scheduling algorithms to minimize the makespan on identical parallel machines

Top ◽  
2001 ◽  
Vol 9 (2) ◽  
pp. 243-269 ◽  
Author(s):  
Ethel Mokotoff ◽  
José Luis Jimeno ◽  
Ana Isabel Gutiérrez
Keyword(s):  
Parallel Machines ◽  
Scheduling Algorithms ◽  
List Scheduling ◽  
Identical Parallel Machines ◽  
List Scheduling Algorithms

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