Hadoop SWIM上的文件放置位置优化

Makoto Nakagami, J. Kon, Gil Jae Lee, J. Fortes, Saneyasu Yamaguchi
{"title":"Hadoop SWIM上的文件放置位置优化","authors":"Makoto Nakagami, J. Kon, Gil Jae Lee, J. Fortes, Saneyasu Yamaguchi","doi":"10.1109/CANDARW.2018.00100","DOIUrl":null,"url":null,"abstract":"Hadoop is a popular platform based on the MapReduce model for processing big data. For I/O performance improvement in Hadoop, this paper uses realistic workloads to conduct in-depth evaluations of a method that optimally places file in storage. This method places files in the outer zones of hard disk drives because sequential access in the outer zones is generally faster than in the inner zones. The research reported in this paper goes beyond using an I/O-intensive job example (e.g., TeraSort) to use realistic workloads generated by Statistical Workload Injector for MapReduce (SWIM). First, the CPU and I/O resource usage by SWIM jobs is explored in various settings and then it is shown that a shuffle-heavy workload is I/O bounded. Second, I/O patterns of some SWIM jobs are investigated and it is shown that their accesses are performed sequentially. Third, the proposed method is applied to a shuffle-heavy SWIM job and evaluated, the results demonstrating that the method can improve performance by 14%.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"File Placing Location Optimization on Hadoop SWIM\",\"authors\":\"Makoto Nakagami, J. Kon, Gil Jae Lee, J. Fortes, Saneyasu Yamaguchi\",\"doi\":\"10.1109/CANDARW.2018.00100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hadoop is a popular platform based on the MapReduce model for processing big data. For I/O performance improvement in Hadoop, this paper uses realistic workloads to conduct in-depth evaluations of a method that optimally places file in storage. This method places files in the outer zones of hard disk drives because sequential access in the outer zones is generally faster than in the inner zones. The research reported in this paper goes beyond using an I/O-intensive job example (e.g., TeraSort) to use realistic workloads generated by Statistical Workload Injector for MapReduce (SWIM). First, the CPU and I/O resource usage by SWIM jobs is explored in various settings and then it is shown that a shuffle-heavy workload is I/O bounded. Second, I/O patterns of some SWIM jobs are investigated and it is shown that their accesses are performed sequentially. Third, the proposed method is applied to a shuffle-heavy SWIM job and evaluated, the results demonstrating that the method can improve performance by 14%.\",\"PeriodicalId\":329439,\"journal\":{\"name\":\"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CANDARW.2018.00100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDARW.2018.00100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

Hadoop是一个基于MapReduce模型处理大数据的流行平台。为了提高Hadoop中的I/O性能,本文使用实际工作负载对优化文件存储的方法进行了深入评估。这种方法将文件放在硬盘驱动器的外部区域,因为外部区域的顺序访问通常比内部区域快。本文报告的研究不仅使用了I/ o密集型作业示例(例如,TeraSort),还使用了统计工作量注入器为MapReduce (SWIM)生成的实际工作负载。首先,研究了在各种设置下SWIM作业对CPU和I/O资源的使用情况,然后显示了重洗刷工作负载是有I/O限制的。其次,研究了一些SWIM作业的I/O模式,结果表明它们的访问是顺序执行的。第三,将该方法应用于一个洗牌较多的SWIM作业并进行了评估,结果表明该方法可将性能提高14%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
File Placing Location Optimization on Hadoop SWIM
Hadoop is a popular platform based on the MapReduce model for processing big data. For I/O performance improvement in Hadoop, this paper uses realistic workloads to conduct in-depth evaluations of a method that optimally places file in storage. This method places files in the outer zones of hard disk drives because sequential access in the outer zones is generally faster than in the inner zones. The research reported in this paper goes beyond using an I/O-intensive job example (e.g., TeraSort) to use realistic workloads generated by Statistical Workload Injector for MapReduce (SWIM). First, the CPU and I/O resource usage by SWIM jobs is explored in various settings and then it is shown that a shuffle-heavy workload is I/O bounded. Second, I/O patterns of some SWIM jobs are investigated and it is shown that their accesses are performed sequentially. Third, the proposed method is applied to a shuffle-heavy SWIM job and evaluated, the results demonstrating that the method can improve performance by 14%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Improving Data Transfer Efficiency for Accelerators Using Hardware Compression Tile Art Image Generation Using Conditional Generative Adversarial Networks A New Higher Order Differential of FeW Non-volatile Memory Driver for Applying Automated Tiered Storage with Fast Memory and Slow Flash Storage DHT Clustering for Load Balancing Considering Blockchain Data Size
×
引用
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