Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
User Manual
Have you forgotten your password?
  1. Home
  2. Faculty of Computer Science and Engineering
  3. Faculty of Computer Science and Engineering: Conference papers
  4. COMPARISON OF RECTANGULAR MATRIX MULTIPLICATION WITH AND WITHOUT BORDER CONDITIONS
Details

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.
File(s)
Loading...
Thumbnail Image
Name

COMPARISON_OF_RECTANGULAR_MATRIX_MULTIPL.pdf

Size

2.59 MB

Format

Adobe PDF

Checksum

(MD5):676feb6ce24d4ce708e5e389a0eee483

⠀

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify