To Overlap or Not to Overlap: Optimizing Incremental MapReduce Computations for On-Demand Data Upload

Abstract : 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 as-pect: users need to upload massive datasets on clouds for their computations. This paper studies the problem of run-ning MapReduce applications when considering the simulta-neous optimization of performance and cost of both the data upload and its corresponding computation taken together. We analyze the feasibility of incremental MapReduce ap-proaches 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 com-putations 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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01094609
Contributor : Bogdan Nicolae <>
Submitted on : Thursday, January 8, 2015 - 4:07:59 PM
Last modification on : Tuesday, March 12, 2019 - 3:36:48 PM
Long-term archiving on : Thursday, April 9, 2015 - 10:06:46 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Stefan Ene, Bogdan Nicolae, Alexandru Costan, Gabriel Antoniu. To Overlap or Not to Overlap: Optimizing Incremental MapReduce Computations for On-Demand Data Upload. DataCloud'14: The 5th International Workshop on Data-Intensive Computing in the Clouds (held in conjunction with SC14), Nov 2014, New Orleans, United States. pp.9-16, ⟨10.1109/DataCloud.2014.7⟩. ⟨hal-01094609⟩

Share

Metrics

Record views

798

Files downloads

277