diplomsko delo
Tomaž Šuen (Author), Damjan Strnad (Mentor), Nikola Guid (Co-mentor)

Abstract

V diplomski nalogi predstavimo paralelne implementacije algoritmov urejanja z uporabo OpenCL, ki omogoča programiranje heterogenih računalniških sistemov. Pokažemo, da lahko s paralelnim izvajanjem algoritmov na grafični procesni enoti pohitrimo urejanje v primerjavi s serijsko izvedbo istih algoritmov na CPE, vendar je učinkovitost paralelizacije odvisna od oblike algoritma.

Keywords

OpenCL;bitonično urejanje;korensko urejanje;sodo-liho urejanje;urenjanje po rangu;paralelno urejanje;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: T. Šuen
UDC: 004.925(043.2)
COBISS: 19020566 Link will open in a new window
Views: 944
Downloads: 77
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: PARALLEL SORTING WITH OPENCL ON GRAPHICS PROCESSING UNIT
Secondary abstract: In this thesis we take a look at parallel implementations of sorting algorithms with the use of OpenCL, which enables programing of heterogeneous computer systems. We show that using the graphics processing unit we can speed up the sorting algorithms in comparison to their serial counterparts on the CPU, but the effectiveness of parallelisation is dependent on the form of the algorithm.
Secondary keywords: OpenCL;bitonic sort;radix sort;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VIII, 43 f.
ID: 8738856