Divide and conquer on hybrid GPU-accelerated multicore systems
DOI10.1137/100806783zbMATH Open1248.65041OpenAlexW2048968534MaRDI QIDQ2904837FDOQ2904837
Authors: Christof Vömel, Stanimire Tomov, Jack Dongarra 
Publication date: 23 August 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100806783
Recommendations
- Towards dense linear algebra for hybrid GPU accelerated manycore systems
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
- Accelerating numerical dense linear algebra calculations with GPUs
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
performancenumerical examplesparallel computationheterogeneous computingmulticoresymmetric eigenvalue problemLAPACKhybrid architecturedivide and conquer algorithmgraphics processing units (GPUs)
Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (6)
- Computing least squares condition numbers on hybrid multicore/GPU systems
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
- Accelerating numerical dense linear algebra calculations with GPUs
- GPU acceleration for Hermitian eigensystems
- A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU-GPU platforms
- Performance and numerical accuracy evaluation of heterogeneous multicore systems for Krylov orthogonal basis computation
Uses Software
This page was built for publication: Divide and conquer on hybrid GPU-accelerated multicore systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904837)
