scholarly journals Affinity multiprocessor scheduling considering communications and synchronizations using a Multiobjective Iterated Local Search algorithm

2021 ◽  
Author(s):  
S. Nesmachnow ◽  
A. Tchernykh
Keyword(s):  
Local Search ◽  
Execution Time ◽  
Search Algorithm ◽  
Multiprocessor Scheduling ◽  
Iterated Local Search ◽  
Search Method ◽  
Scheduling Problem ◽  
Local Search Method ◽  
Scheduling Method ◽  
Time Required

This article studies the affinity scheduling problem in multicore computing systems, considering the minimization of communications and synchronizations. The problem consists in assigning a set of tasks to resources to minimize the overall execution time of the set of tasks and the execution time required to compute the schedule. A Multiobjective Iterated Local Search method is proposed to solve the studied affinity scheduling problem, which considers the different times required for communication and synchronization of tasks executing on different cores of a multicore computer. The experimental evaluation of the proposed scheduling method is performed over realistic instances of the scheduling problem, considering a set of common benchmark applications from the parallel scientific computing field, and a modern multicore platform from National Supercomputing Center, Uruguay. The main results indicate that the proposed multiobjective Iterated Local Search method improves up to 21.6% over the traditional scheduling techniques (a standard Round Robin and a Greedy scheduler)

scholarly journals An Iterated Local Search Algorithm for a Place Scheduling Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Shicheng Hu ◽  
Zhaoze Zhang ◽  
Qingsong He ◽  
Xuedong Sun
Keyword(s):  
Local Search ◽  
Schedule Problem ◽  
Search Algorithm ◽  
Heuristic Method ◽  
Three Dimensional ◽  
Iterated Local Search ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Resource Schedule ◽  
Best Fit

We study the place scheduling problem which has many application backgrounds in realities. For the block manufacturing project with special manufacturing platform requirements, we propose a place resource schedule problem. First, the mathematical model for the place resource schedule problem is given. On the basis of resource-constrained project scheduling problem and packing problem, we develop a hybrid heuristic method which combines priority rules and three-dimensional best fit algorithm, in which the priority rules determine the scheduling order and the three-dimensional best fit algorithm solves the placement. After this method is used to get an initial solution, the iterated local search is employed to get an improvement. Finally, we use a set of simulation data to demonstrate the steps of the proposed method and verify its feasibility.

Sign in / Sign up

Export Citation Format

Share Document