Abstract
AbstractPower consumption is the major cost factor in data centers. It can be reduced by dynamically right-sizing the data center according to the currently arriving jobs. If there is a long period with low load, servers can be powered down to save energy. For identical machines, the problem has already been solved optimally by [25] and [1].In this paper, we study how a data-center with heterogeneous servers can dynamically be right-sized to minimize the energy consumption. There areddifferent server types with various operating and switching costs. We present a deterministic online algorithm that achieves a competitive ratio of 2das well as a randomized version that is 1.58d-competitive. Furthermore, we show that there is no deterministic online algorithm that attains a competitive ratio smaller than 2d. Hence our deterministic algorithm is optimal. In contrast to related problems like convex body chasing and convex function chasing [17, 30], we investigate the discrete setting where the number of active servers must be an integral, so we gain truly feasible solutions.
Highlights
Energy management is an important issue in data centers
There are data centers where the average server utilization is as low as 12% [16]; only for a few days a year is full processing power needed
Idle servers still consume about half of their peak power [29]
Summary
Energy management is an important issue in data centers. A huge amount of a data center’s financial budget is spent on electricity that is needed to operate the servers as well as to cool them [12,20]. There are different server types with various operating and switching costs in a data center. In contrast to our setting, continuous solutions are allowed, i.e., the number of active server xt can be fractional This allows for other techniques in the design and analysis of an algorithm, but the created schedules cannot be used directly in practice. The duration of the permit is fixed to Dj, whereas in our problem the online algorithm can choose for each time slot if it wants to power down a server. Even if each server type is replaced by an infinite number of permits with the duration t and the cost βj + lj · t, it is still a different problem, because the algorithm has to choose the time slot for powering down in advance (when the server is powered up). Other applications are shown in [7, 14, 18, 22, 23, 32, 33]
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
