.png){kind=icon}
.png){kind=icon}
Return
Aggregation Measure Factor-Based Workflow Application Scheduling in Heterogeneous Environments
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2993069.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Task analysis
Scheduling
Quality of service
Program processors
Scheduling algorithms
Heuristic algorithms
Workflow scheduling
deadline
budget
aggregation measure factor
balance factor
planning success rate
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
