2018/03/20 by Ming Zhang, Zizhan Zheng, Zhang, Ming +3
Computer Science · #Caching and Content Delivery #Cloud Computing and Resource Management #FOS: Computer and information sciences #IoT and Edge/Fog Computing #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1803.07649
openalex publication_date 2018/03/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recent studies have shown that power-proportional data centers can save energy cost by dynamically "right-sizing" the data centers based on real-time workload. More servers are activated when the workload increases while some servers can be put into the sleep mode during periods of low load. In this paper, we revisit the dynamic right-sizing problem for heterogeneous data centers with various operational cost and switching cost. We propose a new online algorithm based on a regularization technique, which achieves a better competitive ratio compared to the state-of-the-art greedy algorithm. We further introduce a switching cost offset into the model and extend our algorithm to this new setting. Simulations based on real workload and renewable energy traces show that our algorithms outperform the greedy algorithm in both settings.