Performance Gains in Conjugate Gradient Computation with Linearly Connected GPU Multiprocessors
Harvard University
4th USENIX Workshop on Hot Topics in Parallelism (HotPar ’12), 2012
@article{tarsa2012performance,
title={Performance Gains in Conjugate Gradient Computation with Linearly Connected GPU Multiprocessors},
author={Tarsa, S.J. and Lin, T.H. and Kung, HT},
year={2012}
}
Conjugate gradient is an important iterative method used for solving least squares problems. It is compute-bound and generally involves only simple matrix computations. One would expect that we could fully parallelize such computation on the GPU architecture with multiple Stream Multiprocessors (SMs), each consisting of many SIMD processing units. While implementing a conjugate gradient method for compressive sensing signal reconstruction, we have noticed that large speed-up due to parallel processing is actually infeasible due to the high I/O cost between SMs and GPU global memory. We have found that if SMs were linearly connected, we could gain a 15x speedup by loop unrolling. We conclude that adding these relatively inexpensive neighbor connections for SMs can significantly enhance the applicability of GPUs to a large class of similar matrix computations.
June 14, 2012 by hgpu
