The Community for Technology Leaders
2008 3rd Petascale Data Storage Workshop. (PDSW '08) (2008)
Austin, TX
Nov. 17, 2008 to Nov. 17, 2008
ISSN: 2157-7242
ISBN: 978-1-4244-4208-9
pp: 1-3
Matthew L. Curry , Department of Computer and Information Sciences, University of Alabama at Birmingham, 1300 University Blvd, Rm 115A, 35294-1170, USA
Anthony Skjellum , Department of Computer and Information Sciences, University of Alabama at Birmingham, 1300 University Blvd, Rm 115A, 35294-1170, USA
H. Lee Ward , Computer Science Research Institute, Sandia National Laboratories, PO Box 5800, Albuquerque, NM 87185-1319, USA
Ron Brightwell , Computer Science Research Institute, Sandia National Laboratories, PO Box 5800, Albuquerque, NM 87185-1319, USA
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.
INDEX TERMS
RAID, Reed-Solomon codes
CITATION

M. L. Curry, A. Skjellum, H. L. Ward and R. Brightwell, "Arbitrary dimension Reed-Solomon coding and decoding for extended RAID on GPUs," 2008 3rd Petascale Data Storage Workshop. (PDSW '08)(PDSW), Austin, TX, 2009, pp. 1-3.
doi:10.1109/PDSW.2008.4811887
94 ms
(Ver 3.3 (11022016))