首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于阵列结构的4容错数据布局
引用本文:万武南,杨威.一种基于阵列结构的4容错数据布局[J].成都信息工程学院学报,2014,29(3):238-243.
作者姓名:万武南  杨威
作者单位:成都信息工程学院网络工程学院,四川成都,610225
基金项目:国家自然科学基金资助项目,四川省教育厅重点资助项目
摘    要:保证数据可靠性是存储系统设计的一个关键问题。EEOD码是一类3容错的数据布局,不允许任意4个磁盘同时故障。但随着存储系统中存储介质增大,数据损失概率也越来越大,为了提高系统可靠性,需要高效易于实现的存储容错技术。因此,对EEOD码进行扩展,增加了2列冗余校验列,提出一种新4容错HD-EEOD(Horizontal Diagonal EEOD)码,能容许任意4个磁盘同时故障,并保留EEOD具有简单几何结构编译码特性。基于码的几何结构,给出快速纠4错译码算法,算法易于软硬件实现。并对码的空间利用率、编译码效率进行分析,趋近于容4错编码的最优值,具有很好的性能和应用前景。

关 键 词:存储系统  RAID  数据容错  数据布局  纠删码  EEOD码

An Array-Based Data Placement for Toleration on Four Failures
WAN Wu-nan,YANG Wei.An Array-Based Data Placement for Toleration on Four Failures[J].Journal of Chengdu University of Information Technology,2014,29(3):238-243.
Authors:WAN Wu-nan  YANG Wei
Institution:(School of Network Engineering, Chengdu University of Information Technology, Chengdu 610225,China)
Abstract:There is a key problem of building reliable data in the storage system.The EEOD code which is triple-erasure-correcting code can not tolerate any four failure.As the number of storage devices increases,the chance of losing data unacceptably increases due to storage devieces being down.Thus,A new coding scheme which is an extension of EEOD by adding to two parity columns are introduced.in this paper.The proposed code is used for tolerating four storage components,which is called the HD-EEOD code(Horizontal-Diagonal EEOD code).The encoding and decoding performance of unique geometrical structure is retained.The novel efficient decoding algorithm based on geometrical structure is proposed for correcting various four node failures,which is realized easily.The HD-EEOD code is closer to the optimal performance including storage efficiency,encoding efficiency,decoding efficiency.Meanwhile,the regular structure of encoding and decoding algorithms makes it of practical for storage systems.
Keywords:storage systems  RAID  data tolerance failure  data placement  erasure-correcting codes  EEOD code
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号