DOE OSTI · 1012478
Energy Proportionality and Performance in Data Parallel Computing Clusters
Abstract
Energy consumption in datacenters has recently become a major concern due to the rising operational costs andscalability issues. Recent solutions to this problem propose the principle of energy proportionality, i.e., the amount of energy consumedby the server nodes must be proportional to the amount of work performed. For data parallelism and fault tolerancepurposes, most common file systems used in MapReduce-type clusters maintain a set of replicas for each data block. A coveringset is a group of nodes that together contain at least one replica of the data blocks needed for performing computing tasks. In thiswork, we develop and analyze algorithms to maintain energy proportionality by discovering a covering set that minimizesenergy consumption while placing the remaining nodes in lowpower standby mode. Our algorithms can also discover coveringsets in heterogeneous computing environments. In order to allow more data parallelism, we generalize our algorithms so that itcan discover k-covering sets, i.e., a set of nodes that contain at least k replicas of the data blocks. Our experimental results showthat we can achieve substantial energy saving without significant performance loss in diverse cluster configurations and workingenvironments.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kim, Jinoh, Chou, Jerry, Rotem, Doron. 2011-02-14. Energy Proportionality and Performance in Data Parallel Computing Clusters. https://www.osti.gov/biblio/1012478
Cite the original work for its findings. Save a collection to share your selection of sources.