5816

Investigation on the Use of GPGPU for Fast Sparse Matrix Factorization

Ye Tian, Bin Zhou, Yutong Zhang, Ka Wing Chan
Department of Electrical Engineering, The Hong Kong Polytechnic University, Hong Kong
The Journal of International Council on Electrical Engineering Vol.1 No.1, 2011.1, page(s): 1-122

@article{chan2011investigation,

   title={Investigation on the Use of GPGPU for Fast Sparse Matrix Factorization},

   author={Chan, K.W.},

   journal={The Journal of International Council on Electrical Engineering},

   volume={1},

   number={1},

   pages={116–122},

   year={2011}

}

Source Source   

704

views

Solution for network equations is frequently encountered by power system researchers. With the increasingly larger system size, time consumed network solution is becoming a dominant factor in the overall time cost. One distinct and important feature of the network admittance matrix is that it is highly sparse, which need to be addressed by specialized computation techniques. One technique to accelerate matrix factorization is parallel computation, with which data processing can be divided into different tasks and implemented simultaneously. However, up to now, efficiency of parallel computation algorithm implemented on multi-processor systems is adversely affected by the data communication latency between processors. In this paper, by taking advantage of the parallel computing power of the contemporary Graphic Processing Units (GPU) and designs of sparse technique for matrix factorization implemented on GPU, proposed algorithms are implemented and evaluated on the Computer Unified Device Architecture (CUDA) interface of the NVIDIA GPU. Preliminary results show significant improvement of speed of LU factorization.
Rating: 2.5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: