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...

Full description

Saved in:
Bibliographic Details
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
id sg-ntu-dr.10356-44049
record_format dspace
spelling sg-ntu-dr.10356-440492023-03-03T20:43:50Z Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA Prashanth Srinivas G S. School of Computer Engineering Parallel and Distributed Computing Centre Bertil Schmidt DRNTU::Engineering::Computer science and engineering::Computer systems organization::Performance of systems 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 can be solved in at most cubic time. However, for some areas current algorithms and their sequential implementations are too slow. This is often due to the large dimension or number of LSEs that must be solved in order to accomplish a specific task. To fulfil such purposes Iterative Sparse Matrix Vector Multiplication (SpMV) algorithms need to be designed using useful languages like CUDA that enable seamless communication with GPUs and this is the primary intent of this project. Bachelor of Engineering (Computer Science) 2011-05-20T07:50:36Z 2011-05-20T07:50:36Z 2011 2011 Final Year Project (FYP) http://hdl.handle.net/10356/44049 en Nanyang Technological University 52 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computer systems organization::Performance of systems
spellingShingle DRNTU::Engineering::Computer science and engineering::Computer systems organization::Performance of systems
Prashanth Srinivas G S.
Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
description 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 can be solved in at most cubic time. However, for some areas current algorithms and their sequential implementations are too slow. This is often due to the large dimension or number of LSEs that must be solved in order to accomplish a specific task. To fulfil such purposes Iterative Sparse Matrix Vector Multiplication (SpMV) algorithms need to be designed using useful languages like CUDA that enable seamless communication with GPUs and this is the primary intent of this project.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Prashanth Srinivas G S.
format Final Year Project
author Prashanth Srinivas G S.
author_sort Prashanth Srinivas G S.
title Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
title_short Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
title_full Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
title_fullStr Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
title_full_unstemmed Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
title_sort iterative sparse matrix vector multiplication (spmv) over gf(2) with cuda
publishDate 2011
url http://hdl.handle.net/10356/44049
_version_ 1759858406348292096