计算网格中节能调度算法的比较与分析
This chapter introduced an energy-minimizing task scheduling strategy in distributed systems. The problem was formulated as an extension of the generalized assignment problem. Seven heuristics were proposed to solve this problem. All seven of these heuristics were greedy heuristics, namely, ObFun, Greedy-Min, Greedy-Deadline, Greedy-Max, MaxMin, MinMin StdDev, and MinMax Std-Dev. The seven heuristics were compared against each other with both small and large problem sizes. The simulation results showed that for small-sized problems, Greedy-Min, Greedy-Deadline, Greedy-Max, MinMin StdDev, and MinMax StdDev performed the best. For large-sized problems, ObFun had superior performance in terms of mean energy consumption and mean makespan against all of the other proposed heuristics.
集群、网格和云上的节能工作
In this chapter, we have motivated the development of energy-aware job placement in clusters, grids, and clouds. After describing current computing infrastructures, state-of-the-art techniques for making these infrastructures energy efficient, and current resource management approaches, we have identified the challenges underlying the energy-aware job placement problem. We have reviewed relevant works in the literature that attempt to tackle some of these challenges, and detailed one particular approach. Finally, we have discussed remaining limits and outstanding opportunities. Beyond the need to address remaining scientific and technical challenges, we have demonstrated that there are today strong incentives for energy-aware job placement algorithms to be integrated in production systems.