基于RAID-6的容量扩容布局研究

随着数据量的不断增加，原有存储系统已不能满足海量数据存储的要求。RAID(redundant arrays of independent disks)存储系统因具有良好的数据可靠性、磁盘独立性和可扩展性，成为应用范围最广的存储系统。新型存储技术存在研究迟缓、推广率低的问题，使得在原有RAID存储系统中添加新的磁盘，成为存储海量数据最为便捷，最为有效，成本最低的方式。RAID发展至今，根据对数据存储的不同需求，衍生出了不同层级的RAID存储系统。RAID-6存储系统由数据盘与2个校验盘构成，相较于其他RAID存储系统，具有更好的数据容错功能，更高的数据恢复能力。因此，提出一种基于H-Code针对RAID-6存储系统的扩容算法HS6。该算法在扩容过程中体现了最小化数据迁移量和快速扩容等特性，与传统的Round-Robin和Semi-RR扩容算法相比，该算法减少了73.2%~88.6%的数据迁移量，缩短了30.6%~62.9%的总扩容时间。

Research on capacity expansion based on RAID-6

With the increasing amount of data, the original storage system can no longer meet the requirements of massive data storage. RAID storage system has become the most widely used storage system because of its good data reliability, disk independence and scalability. The new storage technology has the problem of slow research and low promotion rate, making the addition of new disks in the original RAID storage system become the most convenient, most effective and lowest cost way to store massive data. Since the development of RAID, different levels of RAID storage systems have been derived based on the different needs of data storage. The RAID-6 storage system consists of a data disk and two parity disks. Compared with other RAID storage systems, it has better data fault tolerance and higher data recovery capability. This paper presents an H-Code expansion algorithm for the RAID-6 storage system HS6. In the process of capacity expansion, this algorithm reflects the characteristics of minimizing data migration and rapid capacity expansion. Compared with the traditional Round-Robin and Semi-RR scaling algorithms, this algorithm reduces the data migration by 73.2%~88.6%, and shortens the total scaling time by 30.6%~62.9%.