Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments

With the development of heterogeneous distributed computing environment, workflow application scheduling has become an important and challenging problem while Quality of Service (QoS) guarantees are ensured for science workflows. In this paper, we first introduce an aggregation measure factor to bal...

Full description

Bibliographic Details
Main Authors: Ting Sun, Yaqin Zhang, Kaiqi Xiong, Chuangbai Xiao
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9089274/
id doaj-f3ea82d5b94043d686066dd3377d6485
record_format Article
spelling doaj-f3ea82d5b94043d686066dd3377d64852021-03-30T01:52:36ZengIEEEIEEE Access2169-35362020-01-018898508986510.1109/ACCESS.2020.29930699089274Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous EnvironmentsTing Sun0https://orcid.org/0000-0002-3518-5266Yaqin Zhang1https://orcid.org/0000-0002-7767-9803Kaiqi Xiong2https://orcid.org/0000-0003-2933-8083Chuangbai Xiao3https://orcid.org/0000-0002-4676-2479Faculty of Information Technology, Beijing University of Technology, Beijing, ChinaFaculty of Information Technology, Beijing University of Technology, Beijing, ChinaDepartment of Mathematics and Statistics, University of South Florida, Tampa, FL, USAFaculty of Information Technology, Beijing University of Technology, Beijing, ChinaWith the development of heterogeneous distributed computing environment, workflow application scheduling has become an important and challenging problem while Quality of Service (QoS) guarantees are ensured for science workflows. In this paper, we first introduce an aggregation measure factor to balance the execution time and cost of workflow applications. Then, we propose an aggregation measure factor-based scheduling algorithm (AFSA) for workflow applications in a heterogeneous distributed environment. The proposed algorithm through allocating the sub-budget and sub-deadline for each task to choose available processors takes into account of the budget and deadline aggregation to select the processor for the science workflows. Furthermore, we introduce both a planning success rate and normalized deadline (ND) as performance metrics to evaluate workflow application scheduling algorithms. Furthermore, we use both a randomly generated data set and a real-world workflow data set in our experiments for the performance evaluation. Moreover, our experimental results demonstrate that the proposed AFSA has a higher balance factor and an almost equal or higher planning success rate under different workflow application structures compared to the existing algorithms, BHEFT, HBCS, WMFCO, and DBCS.https://ieeexplore.ieee.org/document/9089274/Workflow schedulingdeadlinebudgetaggregation measure factorbalance factorplanning success rate
collection DOAJ
language English
format Article
sources DOAJ
author Ting Sun
Yaqin Zhang
Kaiqi Xiong
Chuangbai Xiao
spellingShingle Ting Sun
Yaqin Zhang
Kaiqi Xiong
Chuangbai Xiao
Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
IEEE Access
Workflow scheduling
deadline
budget
aggregation measure factor
balance factor
planning success rate
author_facet Ting Sun
Yaqin Zhang
Kaiqi Xiong
Chuangbai Xiao
author_sort Ting Sun
title Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
title_short Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
title_full Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
title_fullStr Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
title_full_unstemmed Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
title_sort aggregation measure factor-based workflow application scheduling in heterogeneous environments
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description With the development of heterogeneous distributed computing environment, workflow application scheduling has become an important and challenging problem while Quality of Service (QoS) guarantees are ensured for science workflows. In this paper, we first introduce an aggregation measure factor to balance the execution time and cost of workflow applications. Then, we propose an aggregation measure factor-based scheduling algorithm (AFSA) for workflow applications in a heterogeneous distributed environment. The proposed algorithm through allocating the sub-budget and sub-deadline for each task to choose available processors takes into account of the budget and deadline aggregation to select the processor for the science workflows. Furthermore, we introduce both a planning success rate and normalized deadline (ND) as performance metrics to evaluate workflow application scheduling algorithms. Furthermore, we use both a randomly generated data set and a real-world workflow data set in our experiments for the performance evaluation. Moreover, our experimental results demonstrate that the proposed AFSA has a higher balance factor and an almost equal or higher planning success rate under different workflow application structures compared to the existing algorithms, BHEFT, HBCS, WMFCO, and DBCS.
topic Workflow scheduling
deadline
budget
aggregation measure factor
balance factor
planning success rate
url https://ieeexplore.ieee.org/document/9089274/
work_keys_str_mv AT tingsun aggregationmeasurefactorbasedworkflowapplicationschedulinginheterogeneousenvironments
AT yaqinzhang aggregationmeasurefactorbasedworkflowapplicationschedulinginheterogeneousenvironments
AT kaiqixiong aggregationmeasurefactorbasedworkflowapplicationschedulinginheterogeneousenvironments
AT chuangbaixiao aggregationmeasurefactorbasedworkflowapplicationschedulinginheterogeneousenvironments
_version_ 1724186280146763776