Concentric Layout, a New Scientific Data Distribution Scheme in Hadoop File System

Lu Cheng, Pengju Shang, S. Sehrish, Grant Mackey, Jun Wang
{"title":"Concentric Layout, a New Scientific Data Distribution Scheme in Hadoop File System","authors":"Lu Cheng, Pengju Shang, S. Sehrish, Grant Mackey, Jun Wang","doi":"10.1109/NAS.2010.59","DOIUrl":null,"url":null,"abstract":"The data generated by scientific simulation, sensor, monitor or optical telescope has increased with dramatic speed. In order to analyze the raw data fast and space efficiently, data pre-process operation is needed to achieve better performance in data analysis phase. Current research shows an increasing tread of adopting MapReduce framework for large scale data processing. However, the data access patterns which generally applied to scientific data set are not supported by current MapReduce framework directly. The gap between the requirement from analytics application and the property of MapReduce framework motivates us to provide support for these data access patterns in MapReduce framework. In our work, we studied the data access patterns in matrix files and proposed a new concentric data layout solution to facilitate matrix data access and analysis in MapReduce framework. Concentric data layout is a hierarchical data layout which maintains the dimensional property in large data sets. Contrary to the continuous data layout adopted in current Hadoop framework, concentric data layout stores the data from the same sub-matrix into one chunk, and then stores chunks symmetrically in a higher level. This matches well with the matrix like computation. The concentric data layout preprocesses the data beforehand, and optimizes the afterward run of MapReduce application. The experiments show that the concentric data layout improves the overall performance, reduces the execution time by about 38% when reading a 64 GB file. It also mitigates the unused data read overhead and increases the useful data efficiency by 32% on average.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2010.59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The data generated by scientific simulation, sensor, monitor or optical telescope has increased with dramatic speed. In order to analyze the raw data fast and space efficiently, data pre-process operation is needed to achieve better performance in data analysis phase. Current research shows an increasing tread of adopting MapReduce framework for large scale data processing. However, the data access patterns which generally applied to scientific data set are not supported by current MapReduce framework directly. The gap between the requirement from analytics application and the property of MapReduce framework motivates us to provide support for these data access patterns in MapReduce framework. In our work, we studied the data access patterns in matrix files and proposed a new concentric data layout solution to facilitate matrix data access and analysis in MapReduce framework. Concentric data layout is a hierarchical data layout which maintains the dimensional property in large data sets. Contrary to the continuous data layout adopted in current Hadoop framework, concentric data layout stores the data from the same sub-matrix into one chunk, and then stores chunks symmetrically in a higher level. This matches well with the matrix like computation. The concentric data layout preprocesses the data beforehand, and optimizes the afterward run of MapReduce application. The experiments show that the concentric data layout improves the overall performance, reduces the execution time by about 38% when reading a 64 GB file. It also mitigates the unused data read overhead and increases the useful data efficiency by 32% on average.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
同心布局,一种新的Hadoop文件系统科学数据分布方案
科学模拟、传感器、监视器或光学望远镜产生的数据以惊人的速度增长。为了快速有效地分析原始数据,在数据分析阶段需要进行数据预处理操作,以获得更好的性能。目前的研究表明,采用MapReduce框架进行大规模数据处理的趋势越来越明显。然而,通常应用于科学数据集的数据访问模式,目前的MapReduce框架并不直接支持。分析应用的需求和MapReduce框架的特性之间的差距促使我们在MapReduce框架中提供对这些数据访问模式的支持。在本文的工作中,我们研究了矩阵文件中的数据访问模式,并提出了一种新的同心数据布局解决方案,以方便MapReduce框架下矩阵数据的访问和分析。同心数据布局是一种在大型数据集中保持维度属性的分层数据布局。与当前Hadoop框架采用的连续数据布局不同,同心数据布局将同一子矩阵中的数据存储到一个块中,然后在更高的层次上对称存储块。这与矩阵式计算很匹配。同心数据布局对数据进行预先预处理,优化MapReduce应用的后续运行。实验表明,同心数据布局提高了整体性能,在读取64gb文件时减少了约38%的执行时间。它还减少了未使用的数据读取开销,并将有用数据的效率平均提高了32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Heterogeneous Multi-core Parallel SGEMM Performance Testing and Analysis on Cell/B.E Processor Stabilizing Path Modification of Power-Aware On/Off Interconnection Networks Modelling Speculative Prefetching for Hybrid Storage Systems Binomial Probability Redundancy Strategy for Multimedia Transmission Fast and Memory-Efficient Traffic Classification with Deep Packet Inspection in CMP Architecture
×
引用
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