Cooperative online schedule of interconnected data center microgrids with shared energy storage.

The rapid increasing of data centers calls for an efficient method to reduce high operation costs and carbon emissions. This paper proposes a cooperative online schedule framework for local interconnected data centers considering shared energy storage. A time-average optimization problem is built to reduce the overall operation cost with essential operational constraints. Multiple randomness and the temporal coupling constraints of energy system levels make it challenging to solve the stochastic problem. Adapting the Lyapunov optimization theory with relaxation and perturbation technique, an online algorithm is proposed to find an acceptable solution to the problem to achieve both good service coordination and efficient energy coordination. The algorithm does not require prediction of random parameters, and has a fast convergence rate. Especially, the theoretical conditions for convergence and the distance between the acceptable and real optimal solution are derived in a closed form. Simulation studies show that the algorithm can effectively reduce operation cost of data centers, carbon emissions, and dependence on the main grid. • A new microgrid consisting of local data centers and shared ESS is investigated. • A cooperative framework to realize service and energy coordination is provided. • The proposed online algorithm finds an acceptable solution without predictions. • The algorithm is compared with forward-looking algorithm and rolling algorithm. [ABSTRACT FROM AUTHOR]