.png){kind=icon}
返回
Adaptive Resource Allocation with Job Runtime Uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1007/s10723-017-9410-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we address the problem of dynamic resource allocation in presence of job runtime uncertainty. We develop an execution delay model for runtime prediction, and design an adaptive stochastic allocation strategy, named Pareto Fractal Flow Predictor (PFFP). We conduct a comprehensive performance evaluation study of the PFFP strategy on real production traces, and compare it with other well-known non-clairvoyant strategies over two metrics. In order to choose the best strategy, we perform bi-objective analysis according to a degradation methodology. To analyze possible biasing results and negative effects of allowing a small portion of the problem instances with large deviation to dominate the conclusions, we present performance profiles of the strategies. We show that PFFP performs well in different scenarios with a variety of workloads and distributed resources.
Keyword:
Runtime uncertainty
Distributed system
Resource allocation
Self-similarity
Heavy-tails
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
762
被引数:
1.2K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
Backfilling using system-generated predictions rather than user runtime estimates使用系统生成的预测而不是用户运行时估计进行回填
PREAI
分享收藏Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid网格上具有用户运行时间估计的多个工作流调度策略
PREAI
分享收藏
查看更多内容