Multi-Objective Scientific-Workflow Scheduling with Data Movement Awareness in Cloud

Journal article


Authors/Editors


Strategic Research Themes

No matching items found.


Publication Details

Author listWangsom P., Lavangnananda K., Bouvry P.

PublisherInstitute of Electrical and Electronics Engineers

Publication year2019

JournalIEEE Access (2169-3536)

Volume number7

Start page177063

End page177081

Number of pages19

ISSN2169-3536

eISSN2169-3536

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85076819764&doi=10.1109%2fACCESS.2019.2957998&partnerID=40&md5=5838db09db6a3ddc4091af822c2b22b6

LanguagesEnglish-Great Britain (EN-GB)


View in Web of Science | View on publisher site | View citing articles in Web of Science


Abstract

Due to serving several purposes simultaneously, running scientific workflows on dynamic environments such as cloud computing, has become multi-objective scheduling. Among these purposes, Cost and Makespan are probably the most two primitive objectives. Another critical factor in a large-scale scientific workflow is tremendous amount of data during execution. Therefore, this work also includes Data Movement as an additional objective as it has a major impact on network utilization and energy consumption in network equipment in cloud data center. In considering these three objectives, this work proposes a framework for scheduling solutions which combines a new nodes clustering technique in Directed Acyclic Graph (DAG) model known as Multilevel Dependent Node Clustering (MDNC) and the multi-objective optimization, Extreme Nondominated Sorting Genetic Algorithm-III (E-NSGA-III). E-NSGA-III is the recent extension of Nondominated Sorting Genetic Algorithm (NSGA-III). Five well-known scientific workflows, CyberShake, Epigenomics, LIGO, Montage, and SIPHT are selected as testbeds, while the commonly known Hypervolume is chosen as the performance metric. In this work, MDNC is also experimented with both NSGA-III. Comparison among three approaches, E-NSGA-III alone, E-NSGA-III with Peer-to-Peer clustering and E-NSGA-III with MDNC are carried out. The superiority of the proposed framework among them and its limitation are discussed. ฉ 2013 IEEE.


Keywords

data movementdirected acyclic graph (DAG)extreme nondominated sorting genetic algorithm-III (E-NSGA-III)makespanmultilevel dependent node clustering (MDNC)nondominated sorting genetic algorithm-III (NSGA-III)peer-to-peer clusteringscientific workflows


Last updated on 2023-26-09 at 07:36