ENES: Energy-Efficient Scheduling

ENES：节能调度

• 批准号: 254856932
• 负责人: Professorin Dr. Susanne Albers
• 金额: --
• 依托单位: Lehrstuhl für Informatik XIV: Algorithmen und Komplexität
• 依托单位国家: 德国
• 项目类别: Priority Programmes
• 财政年份: 2014
• 资助国家: 德国
• 起止时间: 2013-12-31 至 2018-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/254856932?language=en
• 关键词: ENES; Energy; Efficient; Scheduling

In this project we will study algorithmic techniques for energy savings in hardware environments, thereby supporting the processing of big data sets on the systems level. We will focus on the technique of dynamic speed scaling as the most promising approach currently known to conserve energy in microprocessor systems. The specific goal of this project is bring algorithmic results closer to practice. Most of the prior work makes idealized architectural assumptions: A processor would have a continuous unbounded speed spectrum, and speed changes could be performed at any time at no cost.We will design and analyze algorithms for the realistic scenario that a processor has a finite set of discrete speed levels. To this end we will adapt strategies known for a continuous processor speed spectrum and, more importantly, design new algorithms that are specifically tailored to the more accurate scenario with discrete speeds. The above theoretically oriented work will be complemented by thorough experiments, forming an algorithms engineering part of the project. To date none of the strategies developed in the algorithmic speed scaling literature has been implemented and tested on real-world data. We wish to overcome this deficiency. Specifically, we will build up a library of data sets and implement / test the proposed algorithms.

在这个项目中，我们将研究硬件环境中节能的算法技术，从而支持系统级大数据集的处理。我们将重点关注动态速度缩放技术，这是目前已知的微处理器系统中最有前途的节能方法。该项目的具体目标是使算法结果更接近实践。大多数先前的工作都是理想化的体系结构假设：处理器将具有连续的无界速度谱，并且可以在任何时间免费执行速度更改。我们将为处理器具有有限离散速度水平的现实场景设计和分析算法。为此，我们将采用已知的连续处理器速度谱策略，更重要的是，设计专门针对离散速度的更精确场景的新算法。上述理论导向的工作将辅以深入的实验，形成项目的算法工程部分。迄今为止，在算法速度缩放文献中开发的任何策略都没有在实际数据上实施和测试。我们希望克服这一缺陷。具体来说，我们将建立一个数据集库并实现/测试所提出的算法。

项目成果

Throughput maximization for speed scaling with agreeable deadlines

• DOI: 10.1007/s10951-015-0452-y
• 发表时间: 2013-05
• 期刊: Journal of Scheduling
• 影响因子: 2
• 作者: Eric Angel;E. Bampis;Vincent Chau;Dimitrios Letsios

Speed-Scaling with No Preemptions

无抢占的速度扩展

• DOI: 10.1007/978-3-319-13075-0_21
• 发表时间: 2014
• 期刊: ArXiv
• 作者: E. Bampis;D. Letsios;G. Lucarelli
• 通讯作者: G. Lucarelli

On Energy Conservation in Data Centers

• DOI: 10.1145/3364210
• 发表时间: 2019-11
• 期刊: ACM Transactions on Parallel Computing (TOPC)
• 作者: S. Albers

Minimizing worst-case and average-case makespan over scenarios

• DOI: 10.1007/s10951-016-0484-y
• 发表时间: 2016-06
• 期刊: Journal of Scheduling
• 影响因子: 2
• 作者: E. Feuerstein;A. Marchetti-Spaccamela;Frans Schalekamp;René Sitters;S. Ster;L. Stougie;A. V. Zuylen

Online Market Intermediation

• DOI: 10.4230/lipics.icalp.2017.47
• 发表时间: 2017-03
• 期刊: ArXiv
• 作者: Yiannis Giannakopoulos;E. Koutsoupias;Philip Lazos