Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
Solving linear systems of equations (LSEs) is a very common computational problem appearing in numerous research disciplines. From a complexity theoretical point of view, the solution of an LSE is efficiently computable, e.g. by using for example the well known Gaussian elimination algorithm any LSE...
Saved in:
Main Author: | Prashanth Srinivas G S. |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Final Year Project |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/44049 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An approach for fast Hierarchical agglomerative clustering using graphics processors with CUDA
by: Shalom, S.A.A., et al.
Published: (2016) -
Concurrent error detection in bit-serial normal basis multiplication over GF(2^m) using multiple parity prediction schemes
by: Lee, Chiou Yng, et al.
Published: (2011) -
Communication Optimization of Iterative Sparse Matrix-Vector Multiply on GPUs and FPGAs
by: Rafique, Abid, et al.
Published: (2015) -
TCP performance study over wired and wireless networks
by: Zhang, Chunlei
Published: (2008) -
End-to-end QoS management for multimedia over IP
by: Zhan, Wenning
Published: (2008)