izpis_h1_title_alt

Paralelizacija Gram–Schmidtovega algoritma na sistemu Intel Xeon Phi
ID MLADOVAN, DOMEN (Author), ID Slivnik, Boštjan (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (1,27 MB)
MD5: 533FB081F5C2C56302DEFA0490101D99
PID: 20.500.12556/rul/391e91c5-25b7-41cc-a4c8-163a01f268d2

Abstract
Gram-Schmidtov postopek je klasičen postopek za ortonormiranje množice vektorjev v vektorskem prostoru s skalarnim produktom. Obstaja več imple- mentacij Gram-Schmidtovega postopka. Klasičen, modificiran in iterativno klasičen Gram-Schmidtov postopek. Izbrali smo klasičen Gram-Schmidtov postopek. Paralelizacijo klasičnega Gram-Schmidtovega postopka smo re- alizirali na koprocesorju Intel Xeon Phi. V programskem jeziku C smo s pomočjo knjižnice OpenMP realizirali več funkcij klasičnega Gram-Schmidtovega postopka. Izkazalo se je, da je najboljša funkcija tista, ki enakomerno poraz- deli delo med vse niti. Vsaka nit najprej vzporedno izračuna enako število projekcij, nato pa se preostale projekcije izvedejo zaporedno, kjer vse niti vzporedno izvedejo eno projekcijo. Implementacija na Intel Xeon Phi je do trikrat hitrejša kot na dveh Intel Xeon procesorjih. Faktor pohitritve se zvišuje z velikostjo vhodne množice vektorjev.

Language:Slovenian
Keywords:paralelizacija, Gram-Schmidt, Intel Xeon Phi
Work type:Master's thesis/paper
Organization:FRI - Faculty of Computer and Information Science
Year:2016
PID:20.500.12556/RUL-91250 This link opens in a new window
Publication date in RUL:27.03.2017
Views:1231
Downloads:338
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Parallelization of Gram-Schmidt algorithm on Intel Xeon Phi system
Abstract:
The Gram-Schmidt process is a classical process for orthonormalising a set of vectors in inner product space. There are many implementations of the Gram-Schmidt process - classical, modified and iterated classical Gram- Schmidt process. In the thesis we have chosen the classical Gram-Schmidt process. Parallelization of classical Gram-Schmidt process was implemented on Intel Xeon Phi coprocessor. We have implemented many different func- tions of classical Gram-Schmidt process in the C programming language with a help of OpenMP library. The results show that the best function is the one that evenly distributes work among all threads. First every thread calculates the same amount of projections, then the rest of projections are calculated sequentially, where the threads compute each projection in parallel. The implementation of the same function on the Intel Xeon Phi is up to three times faster than the same implementation on two Intel Xeon processors. The speedup factor is increasing with the size of input vectors.

Keywords:parallelization, Gram-Schmidt, Intel Xeon Phi

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back