A Low Complexity Design of Reed Solomon Code Algorithm for Advanced RAID System

This paper presents a new low complexity design of Reed Solomon model, which is the key technology for RAID system advanced codec. The real-time constraint of codec leads to a heavy computational bottleneck on today´s data storage devices. To overcome this problem, design analysis and optimization of Reed Solomon code are addressed at the algorithmic level. First, the dominant calculation of spreading function is replaced with small look- , up tables. Second, a method which greatly reduces the number of multipliers in performing the multiplication operations of the codec process is proposed to reduce the RAID (Redundant Array of Inexpensive Disks) system codec complexity while maintaining the quality. Moreover, our algorithm can be expanded to correct multiple failed disks. Therefore, the failed data in disks can be recovered and system still can work as usual without broken. This technique is different from the traditional methods. The proposed design could be implemented in a real-time Reed Solomon codec RAID system with reduction of hardware complexity by 28%. A hybrid strategy considering both data layout and load of storage nodes has a 13-25% higher I/O performance than conventional RS RAID.