Performance of random sampling for computing low-rank approximations of a dense matrix on GPUs

Théo Mary (1) , Ichitaro Yamazaki (2) , Jakub Kurzak (2) , Piotr Luszczek (2) , Stanimire Tomov (2) , Jack Dongarra (2)

1 UT3 - Université Toulouse III - Paul Sabatier
2 ICL - Innovative Computing Laboratory [Knoxville]

A low-rank approximation of a dense matrix plays an important role in many applications. To compute such an approximation , a common approach uses the QR factorization with column pivoting (QRCP). Though the reliability and efficiency of QRCP have been demonstrated, this determin-istic approach requires costly communication at each step of the factorization. Since such communication is becoming increasingly expensive on modern computers, an alternative approach based on random sampling, which can be implemented using communication-optimal kernels, is becoming attractive. To study its potential, in this paper, we compare the performance of random sampling with that of QRCP on an NVIDIA Kepler GPU. Our performance results demonstrate that random sampling can be up to 12.8× faster than the deterministic approach for computing the approximation of the same accuracy. We also present the parallel scaling of the random sampling over multiple GPUs on a single compute node, showing a speedup of 3.8× over three Kepler GPUs. These results demonstrate the potential of the random sampling as an excellent computational tool for many applications, and its potential is likely to grow on the emerging computers with the increasing communication costs.

Domaines: Logiciel mathématique [cs.MS]

Théo Mary, Ichitaro Yamazaki, Jakub Kurzak, Piotr Luszczek, Stanimire Tomov, et al.. Performance of random sampling for computing low-rank approximations of a dense matrix on GPUs. International Conference for High Performance Computing, Networking, Storage and Analysis (SC15), Nov 2015, Austin, TX, United States. pp.60, ⟨10.1145/2807591.2807613⟩. ⟨hal-02311280⟩