.png){kind=icon}
返回
Energy-aware service allocation
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2011.04.018.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the problem of energy-aware resource allocation for hosting long-term services or on-demand computing jobs in clusters, e.g., deployed as part of computing infrastructures. We formalize the problem as three constrained optimization problems: maximize job performance under power consumption constraints, minimize power consumption under job performance constraints, and optimize a linear combination of power consumption and job performance. These problems are NP-hard but, given an instance, a bound on the optimal solution can be computed via a rational linear program. We propose polynomial heuristics for all three problems. Simulation experiments show that in all three cases some heuristics can achieve results close to optimal, i.e., lead to good job performance while conserving energy. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Allocation
Energy-aware
Optimal
Service
Heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
分享收藏Inhibitory effects of catechol accumulation on benzene biodegradation in Pseudomonas putida F1 cultures.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏分享收藏
Use of Taxonomic and Trait-Based Approaches to Evaluate the Effect of Bt maize Expressing Cry1Ie Protein on Non-Target Collembola: A Case Study in Northeast ChinaInsectsOAAI
InsectsIF0
OAAI分享收藏
查看更多内容