COMPARISON OF RECTANGULAR MATRIX MULTIPLICATION WITH AND WITHOUT BORDER CONDITIONS
Date Issued
2013
Author(s)
Lameski, Petre
Djinevski, Leonid
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.
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.
File(s)![Thumbnail Image]()
Loading...
Name
COMPARISON_OF_RECTANGULAR_MATRIX_MULTIPL.pdf
Size
2.59 MB
Format
Adobe PDF
Checksum
(MD5):676feb6ce24d4ce708e5e389a0eee483
