首页|Extending and analysis of X-Code

Extending and analysis of X-Code

扫码查看
X-Code is one of the most important redundant array of independent disk (RAID)-6 codes which are capable of tolerating double disk failures. However, the code length of X-Code is restricted to be a prime number, and such code length restriction of X-Code limits its usage in the real storage systems. Moreover, as a vertical RAID-6 code, X-Code can not be extended easily to an arbitrary code length like horizontal RAID-6 codes. In this paper, a novel and efficient code shortening algorithm for X-Code is proposed to extend X-Code to an arbitrary length. It can be further proved that the code shortening algorithm maintains the maximum-distance-separable (MDS) property of X-Code, and namely, the shortened X-Code is still MDS code with the optimal space efficiency. In the context of the shortening algorithm for X-Code, an in-depth performance analysis on X-Code at consecutive code lengths is conducted, and the impacts of the code shortening algorithm on the performance of X-Code in various performance metrics are revealed.

redundant array of independent disk (RAID)-6X-Codevertical codecode shorteningperformance analysis

JIN Chao、FENG Dan、LIU Jing-ning

展开 >

Wuhan National Laboratory for Optoelectronics, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, P. R. China

国家重点基础研究发展规划(973计划)国家重点基础研究发展规划(973计划)国家高技术研究发展计划(863计划)国家高技术研究发展计划(863计划)国家自然科学基金国家自然科学基金国家自然科学基金Changjiang Innovation Group of Education of China

2011CB3023002011CB3023012009AA01A4012009AA01A402608730286093300261025008IRT0725

2011

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子:0.196
ISSN:1007-6417
年,卷(期):2011.15(3)
  • 1