Accelerating Reed-Solomon coding in RAID systems with GPUs
University of Alabama at Birmingham
Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on In Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on (2008), pp. 1-6
@conference{curry2008accelerating,
title={Accelerating reed-solomon coding in raid systems with gpus},
author={Curry, M.L. and Skjellum, A. and Ward, H.L. and Brightwell, R.},
booktitle={Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on},
pages={1–6},
issn={1530-2075},
year={2008},
organization={IEEE}
}
Graphical Processing Units (GPUs) have been applied to more types of computations than just graphics processing for several years. Until recently, however, GPU hardware has not been capable of efficiently performing general data processing tasks. With the advent of more general-purpose extensions to GPUs, many more types of computations are now possible. One such computation that we have identified as being suitable for the CPU’s unique architecture is Reed-Solomon coding in a manner appropriate for RAID-type systems. In this paper, we motivate the need for RAID with triple-disk parity and describe a pipelined architecture for using a GPU for this purpose. Performance results show that the GPU can outperform a modern CPU on this problem by an order of magnitude and also confirm that a GPU can be used to support a system with at least three parity disks with no performance penalty.
December 11, 2010 by hgpu
