关键词：高效节能；分布式系统；计算网格
摘 要：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.