Srovnání výkonu implementací hash tabulek při paralelním přístupu

Thumbnail Image

Files

MEC0037_FEI_B2647_2612R025_2021.pdf (1.66 MB)
MEC0037_FEI_B2647_2612R025_2021_zadani.pdf (46.79 KB)
MEC0037_FEI_B2647_2612R025_2021_priloha.zip (4.14 MB)
MEC0037_FEI_B2647_2612R025_2021_posudek_vedouci_Baca_Radim.pdf (54.49 KB)
MEC0037_FEI_B2647_2612R025_2021_posudek_oponent_Kratky_Michal.pdf (56.73 KB)

Downloads

10

Date issued

2021

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

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

Location

Signature

Abstract

The goal of this bachelor thesis was to compare the performance of several hash table implementations under a multithreaded workload. The introductory part of this work describes common hash table implementations and compares them with other popular data structures. The rest of this thesis describes the algorithms used in several different hash table implementations and shows the results of three separate benchmarks.

Description

Subject(s)

hash table, multithreading, benchmark, Libcuckoo, Junction, Intel oneAPI Thread Building Blocks, C++

Citation

Item identifier

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

Collections

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