Optimisasi pustaka untuk perkalian matriks menggunakan algoritma strassen berbasis opencl = Library optimization for matrix multiplication using strassen algorithm based opencl

Arvin, Arvin (2014) Optimisasi pustaka untuk perkalian matriks menggunakan algoritma strassen berbasis opencl = Library optimization for matrix multiplication using strassen algorithm based opencl. Bachelor thesis, Universitas Pelita Harapan.

[img] Text (Title)
Title.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (3MB)
[img] Text (Abstract)
Abstract.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (342kB)
[img] Text (ToC)
ToC.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (479kB)
[img] Text (Chapter 1)
Chapter1.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (353kB)
[img] Text (Chapter 2)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (800kB)
[img] Text (Chapter 3)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (446kB)
[img] Text (Chapter 4)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB)
[img] Text (Chapter 5)
Chapter5.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (356kB)
[img] Text (Bibliography)
Bibliography.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB)
[img] Text (Appendices)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (498kB)
[img] Text (Publication Agreement)
Publication Agreement.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (7MB)

Abstract

Software optimization has become very important because of the use of software in the daily activities of society. The lack of maximizing software in the workplace could be caused by a few factors such as the use of inappropriate algorithms and poor program code writing. This report will discuss several optimizations that can be performed upon the Strassen matrix multiplication library using OpenCL. Different types of testing must be performed in order to improve library performance to create a matrix multiplication library that can perform multiplication on both small and large matrices efficiently. These tests utilize matrices of different sizes, and use various test parameters. Data analysis is accomplished by creating tables and graphs from the gathered data, and the conclusion is drawn based on the created tables and graphs. The testing results show that by applying appropriate test parameters then a significant increase in matrix multiplication speed can be achieved. As an example, the calculation of large matrices using optimized Strassen on GPU is 45% faster in term of matrix multiplication computation time, compared to Naive version. However, in the case of smaller size matrices, the Naive algorithm is known to be 17% faster than the optimized Strassen algorithm on GPU.

Item Type: Thesis (Bachelor)
Creators:
CreatorsNIMEmail
Arvin, ArvinUNSPECIFIEDUNSPECIFIED
Contributors:
ContributionContributorsNIDN/NIDKEmail
Thesis advisorYugopuspito, PujiantoUNSPECIFIEDUNSPECIFIED
Thesis advisorSutrisno, SutrisnoUNSPECIFIEDUNSPECIFIED
Additional Information: SK 82-10 ARV o
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: University Subject > Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Depositing User: Mr Samuel Noya
Date Deposited: 04 Oct 2018 07:24
Last Modified: 16 Aug 2021 03:31
URI: http://repository.uph.edu/id/eprint/1132

Actions (login required)

View Item View Item