1. E-Repository - South Eastern University of Sri Lanka
  2. Research Publications
  3. Proceedings
  4. SEUSL Conferences
  5. SEUSL International Symposium
  6. 3rd International Symposium - 2013
Please use this identifier to cite or link to this item: http://ir.lib.seu.ac.lk/handle/123456789/381
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKayanan, M
dc.contributor.authorKanaganathan, S
dc.date.accessioned2015-09-04T03:31:44Z
dc.date.available2015-09-04T03:31:44Z
dc.date.issued2013-07-06
dc.identifier.citationProceedings of the Third International Symposium 2013, pp. 8-10
dc.identifier.issn9789556270426
dc.identifier.urihttp://ir.lib.seu.ac.lk/handle/123456789/381
dc.description.abstractParallel 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 multiplicationen_US
dc.language.isoen_USen_US
dc.publisherSouth Eastern University of Sri lankaen_US
dc.subjectParallel algorithmen_US
dc.subjectSparse matrixen_US
dc.subjectMatrix- Vector multiplicationen_US
dc.subjectSpeedupen_US
dc.titleSparse MatrixVector multiplication using parallel algorithm with block striped partitioningen_US
dc.typeFull paperen_US
Appears in Collections:3rd International Symposium - 2013

Files in This Item:
File Description SizeFormat 
Sparse MatrixVector multiplication.pdf204.91 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.