返回
Slack allocation algorithm for energy minimization in cluster systems
DOI:10.1016/j.future.2016.08.022.png)
摘要
En 中文
Energy consumption has been a critical issue in high-performance computing systems, such as clusters and data centers. An existing technique to reduce energy consumption of applications is dynamic voltage/frequency scaling (DVFS). In this paper, we present a novel algorithm called EASLA for energy aware scheduling of precedence-constrained applications in the context of Service Level Agreement (SLA) on DVFS-enabled cluster systems. Due to the dependencies among tasks and makespan extension, there may be some underused slacks. The main idea of the EASLA algorithm is to distribute each slack to a set of tasks and scale frequencies down to try to minimize energy consumption. Specifically, it first finds the maximum set of independent tasks for each task, and then iteratively allocates each slack to the maximum independent set whose total energy reduction is the maximal. Randomly generated graphs and two real -world applications are tested in our experiments. The experimental results show that our scheduling algorithm can save up to 22.68% and 12.01% energy consumption compared with the GreedyDVS and EvenlyDVS algorithms respectively in homogeneous environments, and 12.33% energy consumption compared with the EES algorithm in heterogeneous environments. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Cluster computing
Directed acyclic graph
Dynamic voltage/frequency scaling
Energy aware scheduling
Service level agreement
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing用于高效管理云计算数据中心的能量感知资源分配启发式方法
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度

