随着数据中心规模的扩大,高能耗问题已经成为高性能计算领域的一个重要问题。针对数据密集型工作流的高能耗问题,提出通过引入"虚拟数据访问节点"的方法来量化评估工作流任务的数据访问能耗开销,并在此基础上设计了一种"最小能耗路径"的启发式策略。在经典的HEFT算法和CPOP算法基础上,通过引入该启发式策略设计并实现了2种具有能耗感知能力的调度算法(HEFT-MECP和CPOP-MECP)。实验结果显示,基于最小能耗路径的启发式调度算法能有效降低数据访问操作的能耗开销,在面对大型的数据密集工作流任务时,该启发式调度策略体现了较好的适应性。
With the increasing scale of data centers, high energy consumption has become a critical issue in high-performance computing area. To address the issue of energy consumption optimization for data-intensive workflow applications, a set of virtual data-accessing nodes are introduced into the original workflow for quantitatively evaluating the data-accessing energy consumption, by which a novel heuristic policy called minimal energy consumption path is designed. Based on the proposed heuristic policy, two energy-aware scheduling algorithms are implemented, which are deprived from the classical HEFT and CPOP scheduling algorithms. Extensive experiments are conducted to investigate the performance of the proposed algorithms, and the results show that they can significantly reduce the data-accessing energy consumption. Also, the proposed algorithms show better adaptive when the system is in presence of large-scale workflows.