Sparse LU Factorization for Parallel Circuit Simulation on GPU
Department of Electronic Engineering, Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing, China
49th Annual Design Automation Conference (DAC ’12), 2012
@inproceedings{ren2012sparse,
title={Sparse LU factorization for parallel circuit simulation on GPU},
author={Ren, L. and Chen, X. and Wang, Y. and Zhang, C. and Yang, H.},
booktitle={Proceedings of the 49th Annual Design Automation Conference},
pages={1125–1130},
year={2012},
organization={ACM}
}
Sparse solver has become the bottleneck of SPICE simulators. There has been few work on GPU-based sparse solver because of the high data-dependency. The strong data-dependency determines that parallel sparse LU factorization runs efficiently on shared-memory computing devices. But the number of CPU cores sharing the same memory is often limited. The state of the art Graphic Processing Units (GPU) naturally have numerous cores sharing the device memory, and provide a possible solution to the problem. In this paper, we propose a GPU-based sparse LU solver for circuit simulation. We optimize the work partitioning, the number of active thread groups, and the memory access pattern, based on GPU architecture. On matrices whose factorization involves many floating-point operations, our GPU-based sparse LU factorization achieves 7.90x speedup over 1-core CPU and 1.49x speedup over 8-core CPU. We also analyze the scalability of parallel sparse LU factorization and investigate the specifications on CPUs and GPUs that most influence the performance.
June 9, 2012 by hgpu
