SEUIR Repository
Sparse MatrixVector multiplication using parallel algorithm with block striped partitioning
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Kayanan, M | |
| dc.contributor.author | Kanaganathan, S | |
| dc.date.accessioned | 2015-09-04T03:31:44Z | |
| dc.date.available | 2015-09-04T03:31:44Z | |
| dc.date.issued | 2013-07-06 | |
| dc.identifier.citation | Proceedings of the Third International Symposium 2013, pp. 8-10 | |
| dc.identifier.issn | 9789556270426 | |
| dc.identifier.uri | http://ir.lib.seu.ac.lk/handle/123456789/381 | |
| 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_US | 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 MatrixVector multiplication using parallel algorithm with block striped partitioning | en_US |
| dc.type | Full paper | en_US |
Files in this item
This item appears in the following Collection(s)
-
3rd International Symposium - 2013 [122]
This is the proceedings of 3rd International Conference held on 06 - 07 July, 2013 at South Eastern University of Sri Lanka