A cost minimization data allocation algorithm for dynamic datacenter resizing

doi:10.1016/j.jpdc.2017.03.010

Return

A cost minimization data allocation algorithm for dynamic datacenter resizing

2018-08-01

PRE

DOI：10.1016/j.jpdc.2017.03.010

Original

Original request for help

Save

Abstract

En 中文

Modern datacenters dynamically adjust the number of active servers in different geographic regions to adapt to the dynamic workloads from user requests and electricity price heterogeneity. One of the main challenges for datacenter resizing is that the heavy network traffic among datacenters causes significant deterioration of the overall performance and considerably increases the operational expenditure of datacenters. In this paper, we propose an efficient data allocation technique that considers both the static and dynamic characteristics of datacenters to enable more efficient datacenter resizing. We first formulate the optimal data allocation problem, propose a genenc model for minimizing the communicating cost in datacenter resizing, and show that the data allocation problem is NP-hard. To produce feasible solution in polynomial time, we propose a heunstic algonthm considering the traffic flow in the network topology of datacenters by first transforming the data allocation problem into a chunk distribution tree (CDT) construction problem, and then reducing the CDT construction to a graph partitioning problem. The experimental results show that our efficient data allocation approach can improve the performance of MapReduce operations effectively with lower communicating and computing costs for datacenter resizing. (C) 2017 Elsevier Inc. All rights reserved.

Keywords:

Big data processing

Cost minimization

Datacenter resizing

Data allocation

MapReduce operation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.