Mapreduce performance model for Hadoop 2.x

View/Open
Cita com:
hdl:2117/124328
Document typeArticle
Defense date2019-01
PublisherElsevier
Rights accessOpen Access
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
MapReduce is a popular programming model for distributed processing of large data sets. Apache Hadoop is one of the most common open-source implementations of such paradigm. Performance analysis of concurrent job executions has been recognized as a challenging problem, at the same time, that may provide reasonably accurate job response time estimation at significantly lower cost than experimental evaluation of real setups. In this paper, we tackle the challenge of defining MapReduce performance model for Hadoop 2.x. While there are several efficient approaches for modeling the performance of MapReduce workloads in Hadoop 1.x, they could not be applied to Hadoop 2.x due to fundamental architectural changes and dynamic resource allocation in Hadoop 2.x. Thus, the proposed solution is based on an existing performance model for Hadoop 1.x, but taking into consideration architectural changes and capturing the execution flow of a MapReduce job by using queuing network model. This way, the cost model reflects the intra-job synchronization constraints that occur due the contention at shared resources. The accuracy of our solution is validated via comparison of our model estimates against measurements in a real Hadoop 2.x setup.
CitationGlushkova, D., Jovanovic, P., Abelló, A. Mapreduce performance model for Hadoop 2.x. "Information systems", Gener 2019, vol. 79, p. 32-43.
ISSN0306-4379
Publisher versionhttps://www.sciencedirect.com/science/article/pii/S0306437917304659
Files | Description | Size | Format | View |
---|---|---|---|---|
paper_is.pdf | 919,5Kb | View/Open |