IHadoop: Asynchronous iterations for MapReduce

Eslam Mohamed Ibrahim Elnikety, Tamer S. El Sayed, Hany E. Ramadan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Scopus citations

Abstract

MapReduce is a distributed programming frame-work designed to ease the development of scalable data-intensive applications for large clusters of commodity machines. Most machine learning and data mining applications involve iterative computations over large datasets, such as the Web hyperlink structures and social network graphs. Yet, the MapReduce model does not efficiently support this important class of applications. The architecture of MapReduce, most critically its dataflow techniques and task scheduling, is completely unaware of the nature of iterative applications; tasks are scheduled according to a policy that optimizes the execution for a single iteration which wastes bandwidth, I/O, and CPU cycles when compared with an optimal execution for a consecutive set of iterations. This work presents iHadoop, a modified MapReduce model, and an associated implementation, optimized for iterative computations. The iHadoop model schedules iterations asynchronously. It connects the output of one iteration to the next, allowing both to process their data concurrently. iHadoop's task scheduler exploits inter-iteration data locality by scheduling tasks that exhibit a producer/consumer relation on the same physical machine allowing a fast local data transfer. For those iterative applications that require satisfying certain criteria before termination, iHadoop runs the check concurrently during the execution of the subsequent iteration to further reduce the application's latency. This paper also describes our implementation of the iHadoop model, and evaluates its performance against Hadoop, the widely used open source implementation of MapReduce. Experiments using different data analysis applications over real-world and synthetic datasets show that iHadoop performs better than Hadoop for iterative algorithms, reducing execution time of iterative applications by 25% on average. Furthermore, integrating iHadoop with HaLoop, a variant Hadoop implementation that caches invariant data between iterations, reduces execution time by 38% on average. © 2011 IEEE.
Original languageEnglish (US)
Title of host publication2011 IEEE Third International Conference on Cloud Computing Technology and Science
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages81-90
Number of pages10
ISBN (Print)9780769546223
DOIs
StatePublished - Nov 2011

Fingerprint

Dive into the research topics of 'IHadoop: Asynchronous iterations for MapReduce'. Together they form a unique fingerprint.

Cite this