Optimizing intermediate data management in MapReduce computations

Diana Moise, Thi-Thu-Lan Trieu, L. Bougé, Gabriel Antoniu
{"title":"Optimizing intermediate data management in MapReduce computations","authors":"Diana Moise, Thi-Thu-Lan Trieu, L. Bougé, Gabriel Antoniu","doi":"10.1145/1967422.1967427","DOIUrl":null,"url":null,"abstract":"Many cloud computations process large datasets. Programming paradigms have been proposed to design this type of applications, so as to take advantage of the huge processing and storage options the cloud holds, but at the same time, to provide the user with a clean and easy to use interface. Among these programming models, we consider the MapReduce paradigm and its reference implementation, the Hadoop framework. We focus on the aspect of intermediate data, that is data produced and transferred between the two stages of the computation (map and reduce). The goal of this paper is to propose a storage mechanism for intermediate data with the purpose of optimizing the execution of MapReduce applications in the presence of failures, while keeping the impact on the job completion time to the minimum. To meet this goal, we rely on a fault-tolerant, concurrency-optimized data storage layer based on the BlobSeer data management service. We modify the Hadoop MapReduce framework to store the intermediate data in this layer (acting as a BlobSeer-based distributed file system) rather than using the local storage of the mappers, as in the vanilla version of Hadoop. To validate this work, we perform experiments on a large number of nodes of the Grid'5000 testbed. We demonstrate that our approach not only provides for intermediate data availability in case of failures, but also efficiently handles read/write accesses so that the overall job completion time is substantially improved.","PeriodicalId":365270,"journal":{"name":"CloudCP '11","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CloudCP '11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1967422.1967427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

Many cloud computations process large datasets. Programming paradigms have been proposed to design this type of applications, so as to take advantage of the huge processing and storage options the cloud holds, but at the same time, to provide the user with a clean and easy to use interface. Among these programming models, we consider the MapReduce paradigm and its reference implementation, the Hadoop framework. We focus on the aspect of intermediate data, that is data produced and transferred between the two stages of the computation (map and reduce). The goal of this paper is to propose a storage mechanism for intermediate data with the purpose of optimizing the execution of MapReduce applications in the presence of failures, while keeping the impact on the job completion time to the minimum. To meet this goal, we rely on a fault-tolerant, concurrency-optimized data storage layer based on the BlobSeer data management service. We modify the Hadoop MapReduce framework to store the intermediate data in this layer (acting as a BlobSeer-based distributed file system) rather than using the local storage of the mappers, as in the vanilla version of Hadoop. To validate this work, we perform experiments on a large number of nodes of the Grid'5000 testbed. We demonstrate that our approach not only provides for intermediate data availability in case of failures, but also efficiently handles read/write accesses so that the overall job completion time is substantially improved.
优化MapReduce计算中的中间数据管理
许多云计算处理大型数据集。已经提出了编程范例来设计这种类型的应用程序,以便利用云所拥有的巨大处理和存储选项,但同时,为用户提供一个干净易用的界面。在这些编程模型中,我们考虑了MapReduce范式及其参考实现——Hadoop框架。我们关注中间数据方面,即在计算的两个阶段(map和reduce)之间产生和传输的数据。本文的目标是提出一种中间数据的存储机制,目的是在出现故障时优化MapReduce应用程序的执行,同时将对作业完成时间的影响降到最低。为了实现这一目标,我们依赖于基于BlobSeer数据管理服务的容错、并发优化的数据存储层。我们修改了Hadoop MapReduce框架,将中间数据存储在这一层(作为基于blobseer的分布式文件系统),而不是像Hadoop的普通版本那样使用映射器的本地存储。为了验证这一工作,我们在Grid’5000测试台的大量节点上进行了实验。我们证明,我们的方法不仅在发生故障时提供了中间数据可用性,而且还有效地处理读/写访问,从而大大提高了总体作业完成时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信