By Topic

DASCA: Data Aware Scaling Down to provide power proportionality for distributed data processing frameworks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kim, H.S. ; Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., Seoul, South Korea ; Dong In Shin ; Young Jin Yu ; Hyeonsang Eom
more authors

Distributed systems have led to the adoption of cloud computing concepts among countless enterprises. A large number of companies have already benefited from delegating IT services to cloud service providers. At the same time, the interest on energy efficiency has dramatically increased. Energy efficiency in large distributed systems is a big concern for system engineers. In addition, the proliferation of distributed data processing frameworks such as MapReduce have led to a vast amount of research and practices. In this paper, we are particularly interested in providing energy proportionality for MapReduce. To provide energy proportionality, we propose Data Aware Scaling Down (DASCA), a scaling down framework for MapReduce. There are two problems we must address in order to support scaling down for MapReduce. The first is to choose a proper set of nodes to suspend, which we call candidate set. The second is to minimize the replica redistribution which occurs during the initiation of power save mode. To address these problems, we use the data awareness of the MapReduce framework. To address the first problem, we provide two greedy algorithms which exploit the data awareness of MapReduce. To address the second problem, we propose locality aware replica redistribution to efficiently redistribute the lost replicas while preserving the availability of replicas and performance of distributed processing.

Published in:

Green Computing Conference and Workshops (IGCC), 2011 International

Date of Conference:

25-28 July 2011