.png){kind=icon}
.png){kind=icon}
Return
Taming System Dynamics on Resource Optimization for Data Processing Workflows: A Probabilistic Approach
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2021.3091400.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many data-intensive applications, workflow is often used as an important model for organizing data processing tasks and resource provisioning is an important and challenging problem for improving the performance of workflows. Recently, system variations in the cloud and large-scale clusters, such as those in I/O and network performances and failure events, have been observed to greatly affect the performance of workflows. Traditional resource provisioning methods, which overlook these variations, can lead to suboptimal resource provisioning results. In this article, we provide a general solution for workflow performance optimizations considering system variations. Specifically, we model system dynamics as time-dependent random variables and take their probability distributions as optimization input. Despite its effectiveness, this solution involves heavy computation overhead. Thus, we propose three pruning techniques to simplify workflow structure and reduce the probability evaluation overhead. We implement our techniques in a runtime library, which allows users to incorporate efficient probabilistic optimization into existing resource provisioning methods. Experiments show that probabilistic solutions can improve the performance by up to 65 percent compared to state-of-the-art static solutions, and our pruning techniques can greatly reduce the overhead of our probabilistic approach.
Keywords:
Optimization
Task analysis
Probabilistic logic
Dynamic scheduling
Data processing
Cloud computing
Probability distribution
Cloud dynamics
resource optimization
data processing workflows
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
View more organizations