On solving the unrelated parallel machine scheduling problem: active microrheology as a case study

被引:0
作者
F. Orts
G. Ortega
A. M. Puertas
I. García
E. M. Garzón
机构
[1] University of Almería,Informatics Department
[2] University of Almería,Department of Applied Physics
[3] Campus Teatinos,Computer Architecture Department
[4] Universidad de Málaga,undefined
来源
The Journal of Supercomputing | 2020年 / 76卷
关键词
Parallel scheduling; Heterogeneous cluster; Unrelated machines; Genetic Algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
Modern computational platforms are characterized by the heterogeneity of their processing elements. Additionally, there are many algorithms which can be structured as a set of procedures or tasks with different computational cost. Balancing the computational load among the available processing elements is one of the main keys for the optimal exploitation of such heterogeneous platforms. When the processing time of any procedure executed on any of the available processing elements is known, this workload-balancing problem can be modeled as the well-known scheduling on unrelated parallel machines problem. Solving this type of problems is a big challenge due to the high heterogeneity on both, the tasks and the machines. In this paper, the balancing problem has been formally defined as a global optimization problem which minimizes the makespan (parallel runtime) and a heuristic based on a Genetic Algorithm, called Genetic Scheduler (GenS), has been developed to solve it. In order to analyze the behavior of GenS for several heterogeneous clusters, an example taken from the field of statistical mechanics has been considered as a case study: an active microrheology model. Given this type of problem and a heterogeneous cluster, we seek to minimize the total runtime to extend and analyze in depth the case of study. In such context, a task consists of the simulation of a tracer particle pulled into a cubic box with smaller bath particles. The computational load depends on the total number of the bath particles. Moreover, GenS has been compared to other dynamic and static scheduling approaches. The experimental results of such a comparison show that GenS outperforms the rest of the tested alternatives achieving a better distribution of the computational workload on a heterogeneous cluster. So, the scheduling strategy developed in this paper is of potential interest for any application which requires the execution of many tasks of different duration (a priori known) on a heterogeneous cluster.
引用
收藏
页码:8494 / 8509
页数:15
相关论文
共 38 条
[1]  
Lenstra JK(1990)Approximation algorithms for scheduling unrelated parallel machines Math Progr 46 259-271
[2]  
Shmoys DB(1993)An approximation algorithm for the generalized assignment problem Math Progr 62 461-474
[3]  
Tardos E(2011)StarPU: a unified platform for task scheduling on heterogeneous multicore architectures Concurr Comp Pract E 23 187-198
[4]  
Shmoys DB(2007)Scout: a data-parallel programming language for graphics processors Parallel Comput 33 648-662
[5]  
Tardos E(2007)Microrheology: a review of the method and applications Soft Matter 3 1449-1455
[6]  
Augonnet C(2014)Microrheology of colloidal systems J Phys Condens Matter 26 243101-117
[7]  
Thibault S(2015)Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem Comput Oper Res 53 107-19
[8]  
Namyst R(2017)Load balancing in cloud using enhanced genetic algorithm Int J Innov Adv Comput Sci 6 13-120
[9]  
Wacrenier P(1994)A genetic algorithm for multiprocessor scheduling IEEE Trans Parallel Distrib Syst 5 113-1345
[10]  
Pea McCormick(2015)Genetic algorithm for task scheduling in heterogeneous distributed computing system Int J Sci Eng Res 6 1338-622