Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/22376| Title: | COMPARISON OF RECTANGULAR MATRIX MULTIPLICATION WITH AND WITHOUT BORDER CONDITIONS | Authors: | Lameski, Petre Mishkovski, Igor Filiposka, Sonja Trajanov, Dimitar Djinevski, Leonid |
Issue Date: | 2013 | Conference: | The 10th Conference for Informatics and Information Technology (CIIT 2013) | Abstract: | Matrix multiplication algorithms are very common and widely used for computation in almost any field. There are many implementations for matrix multiplication on different platforms and programming models. GPU devices in the recent years have become powerful computational units that have entered the segment of high performance computing. In this paper we are analysing two approaches for the matrix multiplication algorithm with and without border conditions for parallel GPU execution. | URI: | http://hdl.handle.net/20.500.12188/22376 |
| Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| COMPARISON_OF_RECTANGULAR_MATRIX_MULTIPL.pdf | 2.65 MB | Adobe PDF | View/Open |
Page view(s)
76
checked on Apr 20, 2024
Download(s)
7
checked on Apr 20, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.