An adaptive data transfer algorithm using block device reconfiguration in virtual MapReduce clusters

Kwonyong Lee, Yoonsung Nam, Taekhee Kim, Sungyong Park
{"title":"An adaptive data transfer algorithm using block device reconfiguration in virtual MapReduce clusters","authors":"Kwonyong Lee, Yoonsung Nam, Taekhee Kim, Sungyong Park","doi":"10.1145/2494621.2494645","DOIUrl":null,"url":null,"abstract":"With the proliferation of cloud computing and virtual machine technologies, MapReduce applications are increasingly deployed in clouds to leverage the full potential of cloud computing environments. However, the MapReduce, which is generally used for processing large amount of data, suffers from the I/O virtualization overheads and resource competitions among virtual machines when it is run on virtual clouds. This paper proposes an adaptive data transfer algorithm in virtual MapReduce clusters. The proposed algorithm utilizes a block device reconfiguration scheme, where a block device attached to a virtual machine can be dynamically detached and reattached to other virtual machines hosted in the same physical machine. By reconfiguring the block devices, we can easily move files across different virtual machines located at the same physical machine without any network transfers between virtual machines. When the output of each map task is transferred to the reducer, this algorithm adaptively determines an appropriate transfer method between network transfer and block device reconfiguration based on current CPU utilization values and the data size for the transfer. Even in the case of data transfer between virtual machines across multiple physical machines, we can remove the transfer overheads between the virtual machine and the driver domain, which results in reducing the data transfer time and performance effects to other virtual machines in the shuffle phase. We have implemented our algorithm in Hadoop MapReduce. The benchmarking results show that the overheads incurred by transferring data from mapper virtual machines to reducer virtual machines are minimized and the execution times of MapReduce applications are shortened.","PeriodicalId":190559,"journal":{"name":"ACM Cloud and Autonomic Computing Conference","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Cloud and Autonomic Computing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2494621.2494645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the proliferation of cloud computing and virtual machine technologies, MapReduce applications are increasingly deployed in clouds to leverage the full potential of cloud computing environments. However, the MapReduce, which is generally used for processing large amount of data, suffers from the I/O virtualization overheads and resource competitions among virtual machines when it is run on virtual clouds. This paper proposes an adaptive data transfer algorithm in virtual MapReduce clusters. The proposed algorithm utilizes a block device reconfiguration scheme, where a block device attached to a virtual machine can be dynamically detached and reattached to other virtual machines hosted in the same physical machine. By reconfiguring the block devices, we can easily move files across different virtual machines located at the same physical machine without any network transfers between virtual machines. When the output of each map task is transferred to the reducer, this algorithm adaptively determines an appropriate transfer method between network transfer and block device reconfiguration based on current CPU utilization values and the data size for the transfer. Even in the case of data transfer between virtual machines across multiple physical machines, we can remove the transfer overheads between the virtual machine and the driver domain, which results in reducing the data transfer time and performance effects to other virtual machines in the shuffle phase. We have implemented our algorithm in Hadoop MapReduce. The benchmarking results show that the overheads incurred by transferring data from mapper virtual machines to reducer virtual machines are minimized and the execution times of MapReduce applications are shortened.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于块设备重构的虚拟MapReduce集群自适应数据传输算法
随着云计算和虚拟机技术的扩散,MapReduce应用程序越来越多地部署在云中,以充分利用云计算环境的全部潜力。然而,通常用于处理大量数据的MapReduce在虚拟云上运行时,存在I/O虚拟化开销和虚拟机之间的资源竞争问题。提出了一种虚拟MapReduce集群中的自适应数据传输算法。该算法利用块设备重构方案,将虚拟机上的块设备动态分离并重新连接到同一物理机上的其他虚拟机上。通过重新配置块设备,我们可以轻松地在位于同一物理机的不同虚拟机之间移动文件,而无需在虚拟机之间进行任何网络传输。当每个map任务的输出传输到reducer时,该算法根据当前CPU利用率值和传输的数据大小,自适应确定网络传输和块设备重构之间合适的传输方式。即使在跨多个物理机的虚拟机之间传输数据的情况下,我们也可以消除虚拟机和驱动程序域之间的传输开销,从而减少在shuffle阶段向其他虚拟机传输数据的时间和性能影响。我们在Hadoop MapReduce中实现了我们的算法。基准测试结果表明,将数据从mapper虚拟机传输到reducer虚拟机的开销降至最低,缩短了MapReduce应用程序的执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Autonomous, failure-resilient orchestration of distributed discrete event simulations A scalable, non-parametric anomaly detection framework for Hadoop Resilient cloud data storage services Autonomic load balancing mechanisms in the P2P desktop grid A virtual machine re-packing approach to the horizontal vs. vertical elasticity trade-off for cloud autoscaling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1