Optimized GPU algorithms for sparse data problems
Many important problems in science and engineering today deal with sparse data. Examples of sparse data include sparse matrices, where the number of nonzero values is much smaller than the total number possible and where nonzeros are located in scattered instead of regular positions, and graphs in w...
Main Author: | Pham, Nguyen Quang Anh |
---|---|
Other Authors: | Wen Yonggang |
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/72409 |
Similar Items
-
Multiple kernels optimization in GPU
by: Sun, Yanan.
Published: (2012) -
GPU accelerated molecular docking with parallel genetic algorithm
by: Ouyang, Xuchang, et al.
Published: (2013) -
Novel techniques for sparse representation problems
by: Chai, Woon Huei
Published: (2021) -
Optimization and scheduling of applications in a heterogeneous CPU-GPU environment
by: Karan Rajendra Shetti
Published: (2014) -
Optimized data reuse via reordering for sparse matrix-vector multiplication on FPGAs
by: Li, Shiqing, et al.
Published: (2022)