To Overlap or Not to Overlap: Optimizing Incremental MapReduce Computations for On-Demand Data Upload
2014 5th International Workshop on Data-Intensive Computing in the Clouds (DataCloud) (2014)
New Orleans, LA, USA
Nov. 21, 2014 to Nov. 21, 2014
Research on cloud-based Big Data analytics has focused so far on optimizing the performance and cost-effectiveness of the computations, while largely neglecting an important aspect: users need to upload massive datasets on clouds for their computations. This paper studies the problem of running MapReduce applications when considering the simultaneous optimization of performance and cost of both the data upload and its corresponding computation taken together. We analyze the feasibility of incremental MapReduce approaches to advance the computation as much as possible during the data upload by using already transferred data to calculate intermediate results. Our key finding shows that overlapping the transfer time with as many incremental computations as possible is not always efficient: a better solution is to wait for enough to fill the computational capacity of the MapReduce cluster. Results show significant performance and cost reduction compared with state-of-the-art solutions that leverage incremental computations in a naive fashion.
Data transfer, Cloud computing, Throughput, Computational modeling, Algorithm design and analysis, Context, Data models
S. Ene, B. Nicolae, A. Costan and G. Antoniu, "To Overlap or Not to Overlap: Optimizing Incremental MapReduce Computations for On-Demand Data Upload," 2014 5th International Workshop on Data-Intensive Computing in the Clouds (DataCloud)(DATACLOUD), New Orleans, LA, USA, 2014, pp. 9-16.