| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:DINAMIČNI PARALELIZEM NA GPE
Authors:ID Urh, Filip (Author)
ID Strnad, Damjan (Mentor) More about this mentor... New window
Files:.pdf UN_Urh_Filip_2015.pdf (2,76 MB)
MD5: 6D11DDB49D051B5451AFC02C4B045B81
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu preučimo in predstavimo novo funkcionalnost arhitekture CUDA. Gre za dinamični paralelizem, ki omogoča poganjanje programskih jeder neposredno iz grafične procesne enote. V začetku podrobno predstavimo arhitekturo CUDA in algoritem CART za gradnjo odločitvenih dreves, ki smo ga uporabili za demonstracijo uporabe dinamičnega paralelizma. Algoritem smo implementirali v zaporedni različici na CPE ter v paralelnih različicah z in brez dinamičnega paralelizma na GPE. Predstavili smo primerjalne meritve časov izvajanja vseh treh implementacij in ugotovili, da uporaba dinamičnega paralelizma omogoča krajši čas izvajanja in lažjo implementacijo algoritma.
Keywords:grafična procesna enota, odločitveno drevo, CART, CUDA, dinamični paralelizem
Place of publishing:[Maribor
Publisher:F. Urh
Year of publishing:2015
PID:20.500.12556/DKUM-54684 New window
UDC:004.274.032.24(043.2)
COBISS.SI-ID:19332630 New window
NUK URN:URN:SI:UM:DK:WBWCEWXW
Publication date in DKUM:14.10.2015
Views:1854
Downloads:112
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:DYNAMIC PARALLELISM ON A GPU
Abstract:In the thesis, we investigate and introduce new functionality of CUDA architecture - the dynamic parallelism, which allows us to start new kernels directly from the GPU. In the beginning, we present in detail the CUDA architecture and algorithm CART for the construction of decision trees, which was used to demonstrate the use of dynamic parallelism. The serial algorithm was implemented on the CPU and the parallel versions with and without dynamic parallelism were implemented on the GPU. We presented a comparison of execution times for all three implementations and concluded that the usage of dynamic parallelism provides faster execution and easier implementation of the algorithm.
Keywords:graphics processing unit, decision tree, CART, CUDA, dynamic parallelism


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica