Zpět na vyhledávání

Bc. Miroslav Stuhl

Master's thesis

Computing Strongly Connected Components with CUDA

Computing Strongly Connected Components with CUDA
Abstract:
Cieľom tejto práce je preskúmať nové prístupy k CUDA akcelerovanému BFS algoritmu a analyzovať ich použitie na problém rozkladu grafu na silne súvislé komponenty pomocou grafických kariet.
Abstract:
The goal of this work is to explore novel approaches to CUDA accelerated breadth-first search (BFS) algorithm and analyze their application in a state-of-the-art algorithm for graph decomposition into strongly connected components via CUDA capable devices, i.e. GPUs.
 

Keywords

strongly connected components SCC CUDA breadth first search BFS GPGPU
 
Language used: English
Date on which the thesis was submitted / produced: 27. 5. 2013
Identifier: https://is.muni.cz/th/xtik2/

Thesis defence

  • Date of defence: 28. 6. 2013
  • Supervisor: RNDr. Milan Češka, Ph.D.
  • Reader: RNDr. Jiří Filipovič, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Theoretical Informatics

Theses on a related topic

List of theses with an identical keyword.