Name
Abstract | ||
|---|---|---|
Reducing the power consumption has become one of the most important challenges in designing modern data centers due to the explosive growth of data. The traditional approaches employed to decrease the power consumption normally do not consider the power of IT devices and the power of cooling system simultaneously. In contrast to existing works, this paper proposes a power model which can minimize the overall power consumption of data centers by balancing the computing power and cooling power. Furthermore, an Enhanced Genetic Algorithm (EGA) is designed to explore the solution space of the power model since the model is a linear programming problem. However, EGA is computing intensive and the performance gradually decreases with the growth of the problem size. Therefore, Heuristic Greedy Sequence (HGS) is proposed to simplify the calculation by leveraging the nature of greed. In contrast to EGA, HGS can determine the workload allocation of a specific data center layout with only one calculation. Experimental results demonstrate that both the EGA and HGS can significantly reduce the power consumption of data centers in contrast to the random algorithm. Additionally, HGS significantly outperforms that of EGA.
|
Year | Venue | Field |
|---|---|---|
2016 | Conf. Computing Frontiers | Randomized algorithm,Heuristic,Workload,Computer science,Parallel computing,Real-time computing,Water cooling,Linear programming,Data center,Genetic algorithm,Power consumption |
DocType | ISBN | Citations |
Conference | 978-1-4503-4128-8 | 1 |
PageRank | References | Authors |
0.35 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruihong Lin | 1 | 6 | 1.09 |
| Yuhui Deng | 2 | 331 | 39.56 |
| Liyao Yang | 3 | 1 | 0.35 |