Overview of QUIC-SVD - UMass Graphics Lab - University of ...

More documents

Recommendations

Info

Conclusion • A fast GPU-based implementation of an approximate SVD algorithm. • Reasonable (up to 6~7 ×) speedup over an optimized CPU implementation, and Tygert SVD. • Our partitioned version allows processing out-of-core matrices. 40
Future Work • Be able to process sparse matrices. • Application in solving large graph Laplacians. • Components from this project can become building blocks for other algorithms: random projection trees, diffusion wavelets etc. 41
Page 1 and 2: A GPU-based Approximate SVD Algorit
Page 3 and 4: Introduction • Approximate SVD
Page 5 and 6: Introduction • Sample-based Appro
Page 7 and 8: Our Goal • Map QUIC-SVD onto the
Page 9 and 10: Our Work • A CUDA implementation
Page 11 and 12: Overview of QUIC-SVD [Holmes et al.
Page 17 and 18: Overview of QUIC-SVD • Monte Carl
Page 19 and 20: GPU Implementation of QUIC-SVD •
Page 21 and 22: Parallelize Gram Schmidt Orthogonal
Page 23 and 24: Parallelize Gram Schmidt Orthogonal
Page 25 and 26: Extract the Final Result • Input:
Page 27 and 28: … … … … Partitioned QUIC-SV
Page 29 and 30: Partitioned QUIC-SVD 29
Page 31 and 32: Implementation Details • Main imp
Page 33 and 34: Performance • Comparisons: 1. Mat
Page 35 and 36: Performance - Speedup Factors 35
Page 37 and 38: Performance - CPU vs. GPU QUIC-SVD
Page 39: Integration with Manifold Alignment

Overview of QUIC-SVD - UMass Graphics Lab - University of ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?