MapReduce across Distributed Clusters for Data-intensive Applications
Citations Over TimeTop 10% of 2012 papers
Abstract
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 are 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 GHadoop, a MapReduce framework that aims to enable large-scale distributed computing across multiple clusters. G-Hadoop uses the Gfarm file system as an underlying file system and executes MapReduce tasks across distributed clusters. Experiments of the G-Hadoop framework on distributed clusters show encouraging results.
Related Papers
- → The Hadoop Distributed File System(2010)4,800 cited
- → G-Hadoop: MapReduce across distributed data centers for data-intensive computing(2012)325 cited
- → Using Hadoop File System and MapReduce in a small/medium Grid site(2012)4 cited
- Performance Evaluation of Hadoop Distributed File System and Local File System(2014)