Real-time power optimization for application server clusters based on Mixed-Integer Programming

Abstract

In the environment of peer competition and energy conservation, optimizing the deployment of application server clusters in real time according to actual workload conditions to reduce operating costs and energy consumption is an important issue that must be urgently addressed. In this paper, we propose a real-time power optimization strategy for application server clusters, and the optimization measures include CPU dynamic voltage/frequency scaling and server dynamic switching. First, the feasibility of defining variables for server types is proved, and appropriate variables are defined to describe the cluster power optimization as a mixed-integer programming (MIP) problem. Then, two solution methods are proposed: the exact method based on the Gurobi optimizer and the approximate method based on primary–secondary optimization and differential evolution with two mutations (PSODE). The former turns the MIP problem into a standard mixed-integer quadratic programming form by introducing intermediate variables and solves it using the Gurobi optimizer. The latter rewrites the MIP problem as a primary–secondary optimization problem and proposes a differential evolutionary-based solution algorithm for the primary optimization problem. The evolutionary process consists of two mutation operations, inter- and intraindividual mutations, which both use a heuristic policy to accelerate the evolution convergence. The test results reveal that the Gurobi-based method can quickly determine the global optimal deployment when the cluster size is small. The PSODE-based method can quickly determine the global optimal deployment or high-quality suboptimal deployment when applied to large-scale clusters.