The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal scheduling and present theoretical foundations of the same. We derive results concerning energy-minimal scheduling of independent jobs in a distributed system with functionally similar machines with different working and idle power ratings. The machines considered in our system can have identical as well as different speeds. If the jobs can be divided into arbitrary parts, we show that the minimum-energy schedule can be generated in linear time and give exact scheduling algorithms. For the cases where jobs are non-divisible, we prove that the scheduling problems are NP-hard and also give approximation algorithms for the same along with their bounds.

在分布式系统中获得能源效率的问题很重要，但是远未开发出通用的非领域特定的能源最小调度理论。在本文中，我们对能量最小调度问题进行了分类，并提出了相同的理论基础。我们得出关于在功能相似的机器上具有不同工作和闲置额定功率的分布式系统中独立作业的能量最小调度的结果。我们系统中考虑的机器可以具有相同的速度，也可以具有不同的速度。如果可以将作业划分为任意部分，则表明可以在线性时间内生成最小能量计划，并给出精确的计划算法。对于不可分割的工作，