Grafové knižnice pre HPC

Thumbnail Image

Files

MAJ0142_FEI_B0613A140014_2022.pdf (1.52 MB)
MAJ0142_FEI_B0613A140014_2022_zadani.pdf (49.29 KB)
MAJ0142_FEI_B0613A140014_2022_priloha.zip (210.22 MB)
MAJ0142_FEI_B0613A140014_2022_posudek_vedouci_Dvorsky_Jiri.pdf (55.5 KB)
MAJ0142_FEI_B0613A140014_2022_posudek_oponent_Golasowski_Martin.pdf (55.77 KB)

Downloads

1

Date issued

2022

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Vysoká škola báňská – Technická univerzita Ostrava

Location

Signature

Abstract

This bachelor thesis is focused on graphs, graph algorithms and libraries designed for implementing graph algorithms. But the entire bachelor thesis is primarily targeted at the HPC platform. First, the basic concepts related to graphs are clarified, then the individual HPC libraries for handling graphs are described. An important part of the work are the implementations of the breadth-first search algorithm and the Pagerank algorithm in selected described graph libraries. Finally, the execution speeds of the algorithms in the described libraries are measured.

Description

Subject(s)

graph, supercomputer, library, Pregel, Apache Giraph, GraphX, Mizan, Gunrock, Medusa, Ligra, GraphChi, GridGraph, algorithm, breadth-first search, Pagerank

Citation

Item identifier

http://hdl.handle.net/10084/147527

Collections

Vysokoškolské kvalifikační práce Fakulty elektrotechniky a informatiky / Theses and dissertations of Faculty of Electrical Engineering and Computer Science (FEI)