Arbitrary dimension Reed-Solomon coding and decoding for extended RAID on GPUs

Author

Curry, Matthew L. ; Skjellum, Anthony ; Ward, H. Lee ; Brightwell, Ron

Author_Institution

Dept. of Comput. & Inf. Sci., Univ. of Alabama at Birmingham, Birmingham, AL

fYear

2008

fDate

17-17 Nov. 2008

Firstpage

1

Lastpage

3

Abstract

Reed-Solomon coding is a method of generating arbitrary amounts of checksum information from original data via matrix-vector multiplication in finite fields. Previous work has shown that CPUs are not well-matched to this type of computation, but recent graphical processing units (GPUs) have been shown through a case study to perform this encoding quickly for the 3 + 3 (three data + three parity) case. In order to be utilized in a true RAID-like system, it is important to understand how well this computation can scale in the number of data disks supported. This paper details the performance of a general Reed-Solomon encoding and decoding library that is suitable for use in RAID-like systems. Both generation and recovery are performance-tested and discussed.

Keywords

RAID; Reed-Solomon codes; GPU; Reed-Solomon coding; Reed-Solomon decoding; checksum information; extended RAID; graphical processing units; matrix-vector multiplication; Application software; Costs; Decoding; Encoding; Galois fields; Hardware; High performance computing; Libraries; Reed-Solomon codes; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Petascale Data Storage Workshop, 2008. PDSW '08. 3rd

Conference_Location

Austin, TX

Print_ISBN

978-1-4244-4208-9

Type

conf

DOI

10.1109/PDSW.2008.4811887

Filename

4811887