G-Hadoop: MapReduce across distributed data centers for data-intensive computing

Lizhe Wang

doi:10.1016/j.future.2012.09.001

G-Hadoop: MapReduce across distributed data centers for data-intensive computing

2013-03-01

261

PRE

AI

DOI：10.1016/j.future.2012.09.001

Original

Original request for help

Save

Abstract

En 中文

Recently, the computational requirements for large-scale data-intensive analysis of scientific data have grown significantly. In High Energy Physics (HEP) for example, the Large Hadron Collider (LHC) produced 13 petabytes of data in 2010. This huge amount of data is processed on more than 140 computing centers distributed across 34 countries. The MapReduce paradigm has emerged as a highly successful programming model for large-scale data-intensive computing applications. However, current MapReduce implementations are developed to operate on single cluster environments and cannot be leveraged for large-scale distributed data processing across multiple clusters. On the other hand, workflow systems are used for distributed data processing across data centers. It has been reported that the workflow paradigm has some limitations for distributed data processing, such as reliability and efficiency. In this paper, we present the design and implementation of G-Hadoop, a MapReduce framework that aims to enable large-scale distributed computing across multiple clusters. (C) 2012 Elsevier B.V. All rights reserved.

Keywords:

Cloud computing

Massive data processing

Data-intensive computing

Hadoop

MapReduce

G-Hadoop: MapReduce across distributed data centers for data-intensive computing

Abstract

Journal

Organization