Abstract

Singular value decomposition (SVD) is one of the most fundamental matrix calculations in numerical linear algebra. Traditional solution is the QR-iteration-based SVD algorithm on CPU, and it is time-consuming. Nowadays, Graphics Processing Units (GPUs) are suited for many general purpose tasks and have emerged as low price and high performance accelerators. In this paper, the parallel-friendly divide-and-conquer approach is employed to accelerate SVD algorithm on the heterogeneous multicore and multi-GPU systems. Two mechanisms are designed to make good use of the computational resource on the heterogeneous system, including two-layer divide-and-conquer and coordination between CPU and GPU. The experimental results show that our algorithm is faster than Intel MKL with four CPU cores, and reaches 45 times speedup with four NVIDIA GTX460 GPUs over LAPACK. Our implementation can also achieve about 1.5 times speedup by doubling the number of GPU devices.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.