Sparse Matrix Vector multiplication using parallel algorithm with block striped partitioning

Kayanan, M.; Kanaganathan, S.

dc.contributor.author	Kayanan, M.
dc.contributor.author	Kanaganathan, S.
dc.date.accessioned	2022-05-18T04:07:04Z
dc.date.available	2022-05-18T04:07:04Z
dc.date.issued	06-07-13
dc.identifier.uri	http://drr.vau.ac.lk/handle/123456789/113
dc.description.abstract	Parallel algorithm may be executed as a piece at a time on many processing devices, and then return results at the end. A sparse matrix is huge and consists many zero elements. Its execution process is extremely time-consuming. This paper describes, how to do Sparse Matrix-Vector multiplication using parallel algorithm with block striped partitioning. Speed-up of Sparse Matrix-Vector multiplication measured with increasing number of processors. Experiment results shows that this method increase the speed-up of Sparse Matrix-Vector multiplication	en_US
dc.language.iso	en	en_US
dc.publisher	South Eastern University of Sri Lanka	en_US
dc.subject	Parallel algorithm	en_US
dc.subject	Sparse matrix	en_US
dc.subject	Matrix-Vector multiplication	en_US
dc.subject	Speedup	en_US
dc.title	Sparse Matrix Vector multiplication using parallel algorithm with block striped partitioning	en_US
dc.type	Conference full paper	en_US
dc.identifier.proceedings	Third International Symposium. South Eastern University of Sri Lanka.	en_US