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...
Saved in:
Main Author: | Pham, Nguyen Quang Anh |
---|---|
Other Authors: | Wen Yonggang |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/72409 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Solving the traveling salesman problem using genetic algorithm on Nvidia Cuda GPU
by: Quang, Mau Bach.
Published: (2011) -
Scheduling algorithms for multi-core and GPU
by: Song, Lee Yong.
Published: (2011) -
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) -
GPU-parallelized artificial bee colony algorithm (GP-ABC) in data clustering application
by: Anggacipta, Gerry
Published: (2014)