Modified multi-objective firefly algorithm for task scheduling problem on heterogeneous systems

被引:8
|
作者
Eswari, R. [1 ]
Nickolas, S. [1 ]
机构
[1] Natl Inst Technol, Dept Comp Applicat, Tiruchirappalli 620015, Tamil Nadu, India
关键词
task scheduling problem; multi-objective optimisation; multi-objective firefly algorithm; MOFA; modified algorithms; LOCAL SEARCH; RELIABILITY; ALLOCATION;
D O I
10.1504/IJBIC.2016.081325
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Scheduling an application in a heterogeneous environment to find an optimal schedule is a challenging optimisation problem. Maximising the reliability of the application even when processors fails, adds more complexity to the problem. Both the objectives are conflict in nature, where maximising reliability of the application may increase application's completion time. Meta-heuristic algorithms are playing important role in solving the optimisation problem. In this paper, the applicability and efficiency of the new meta-heuristic algorithm called firefly algorithm to solve the workflow multi-objective task scheduling problem is studied. A modified version of the firefly algorithm (MFA) using weighted sum method and a modified version of multi-objective firefly algorithm (MMOFA) using Pareto-dominance method are proposed to solve the multi-objective task scheduling problem. The simulation results show that the proposed algorithms can be used for producing task assignments and also give significant improvements in terms of generating schedule with minimum makespan and maximum reliability compared with existing algorithms.
引用
收藏
页码:379 / 393
页数:15
相关论文
共 50 条