Hybrid evolutionary workflow scheduling algorithm for dynamic heterogeneous distributed computational environment

The optimal workflow scheduling is one of the most important issues in heterogeneous distributed computational environments. Existing heuristic and evolutionary scheduling algorithms have their advantages and disadvantages. In this work we propose a hybrid algorithm based on heuristic methods and ge...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied logic Vol. 24; pp. 50 - 61
Main Authors: Nasonov, D., Visheratin, A., Butakov, N., Shindyapina, N., Melnik, M., Boukhanovsky, A.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.11.2017
Elsevier Science Ltd
Subjects:
ISSN:1570-8683, 1570-8691
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The optimal workflow scheduling is one of the most important issues in heterogeneous distributed computational environments. Existing heuristic and evolutionary scheduling algorithms have their advantages and disadvantages. In this work we propose a hybrid algorithm based on heuristic methods and genetic algorithm (GA) that combines best characteristics of both approaches. We propose heuristic algorithm called Linewise Earliest Finish Time (LEFT) as an alternative for HEFT in initial population generation for GA. We also experimentally show efficiency of described hybrid schemas GAHEFT, GALEFT, GACH for traditional workflow scheduling as well as for variable workload in dynamically changing heterogeneous computational environment.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1570-8683
1570-8691
DOI:10.1016/j.jal.2016.11.013