基于GE码的HDFS优化方案  

HDFS optimization program based on GE coding

作　　者：朱媛媛[1] 王晓京[1] 

机构地区：[1]中国科学院成都计算机应用研究所,成都610041

出　　处：《计算机应用》2013年第3期730-733,共4页journal of Computer Applications

基　　金：国家863计划项目(2008AAO1Z402)

摘　　要：针对Hadoop分布式文件系统(HDFS)数据容灾效率和小文件问题,提出了基于纠删码的解决方案。该方案引用了新型纠删码(GE码)的编码和译码模块,对HDFS中的文件进行编码分片,生成很多个Slice并随机均匀的分配保存到集群中,代替原来HDFS系统的多副本容灾策略。该方法中引入了Slice的新概念,将Slice进行分类合保存在block中并然后通过对Slice建立二级索引来解决小文件问题;该研究方法中抛弃了三备份机制,而是在集群出现节点失效的情况下,通过收集与失效文件相关的任意70%左右的Slice进行原始数据的恢复。通过相关的集群实验结果表明,该方法在容灾效率、小文件问题、存储成本以及安全性上对HDFS作了很大的优化。Concerning Hadoop Distributed File System （HDFS） data disaster recovery efficiency and small fines, this paper presented an improved solution based on coding and the solution introduced a coding module of erasure GE to HDFS. Different from the multiple-replication strategy adopted by the original system, the module encoded files of HDFS into a great number of slices, and saved them dispersedly into the clusters of the storage system in distributed fashion. The research methods introduced the new concept of the slice, slice was classified and merged to save in the block and the secondary index of slice was established to solve the small files issue. In the case of cluster failure, the original data would be recovered via decoding by collecting any 70% of the slice, the method also introduced the dynamic replication strategies, through dynamically creating and deleting replications to keep the whole cluster in a good load-balancing status and settle the hotspot issues. The experiments on analogous clusters of storage system show the feasibility and advantages of new measures in proposed solution.

关 键 词：HADOOP分布式文件系统 纠删码 数据容灾 两级索引 

分 类 号：TP309.3[自动化与计算机技术—计算机系统结构] TP393[自动化与计算机技术—计算机科学与技术]