gpurecsplit
Parallel space-efficient minimal perfect hash function on SIMD and GPU
Science Score: 77.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
✓DOI references
Found 1 DOI reference(s) in README -
✓Academic publication links
Links to: arxiv.org -
✓Committers with academic emails
1 of 2 committers (50.0%) from academic institutions -
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (13.4%) to scientific vocabulary
Repository
Parallel space-efficient minimal perfect hash function on SIMD and GPU
Basic Info
Statistics
- Stars: 14
- Watchers: 5
- Forks: 0
- Open Issues: 0
- Releases: 1
Metadata Files
README.md
GpuRecSplit / SimdRecSplit
We greatly improve the construction time of the RecSplit Minimal Perfect Hash Function using two orthogonal approaches. Rotation fitting hashes the objects in each leaf to two sets and tries to combine them to a bijection by cyclically shifting one set to fill the holes in the other. In addition, we harness parallelism on the level of bits, vectors, cores, and GPUs. The code in this repository achieves significant speedups on SIMD machines and GPUs, compared to the original RecSplit implementation.
Construction performance

| l | b | Method | Threads | B/Object | us/Object | Speedup | |---:|---:|:---|---:|---:|---:|---:| | 16 | 2000 | RecSplit [ALENEX'20] | 1 | 1.560 | 1175.4 | | | 16 | 2000 | SimdRecSplit | 1 | 1.560 | 138.0 | 8 | | 16 | 2000 | SimdRecSplit | 16 | 1.560 | 27.9 | 42 | | 16 | 2000 | GpuRecSplit | 4 | 1.5601 | 1.0 | 1173 | | 18 | 50 | RecSplit [ALENEX'20] | 1 | 1.707 | 2942.9 | | | 18 | 50 | SimdRecSplit | 1 | 1.709 | 58.3 | 50 | | 18 | 50 | SimdRecSplit | 16 | 1.708 | 12.3 | 239 | | 18 | 50 | GpuRecSplit | 4 | 1.709 | 0.5 | 5438 | | 24 | 2000 | GpuRecSplit | 4 | 1.498 | 467.9 | |
In the space efficient configurations here, we use n = 5 million objects (strong scaling). For more detailed measurements, refer to our paper.
Library Usage
Clone (with submodules, git clone --recursive) this repo and add it to your CMakeLists.txt:
add_subdirectory(path/to/GpuRecSplit)
target_link_libraries(YourTarget PRIVATE RecSplit SIMDRecSplit GPURecSplit) # or a subset of the targets
Reproducing Experiments
This repository contains the source code and our reproducibility artifacts for the benchmarks specific to GpuRecSplit/SimdRecSplit. Benchmarks that compare SimdRecSplit to competitors are available in a different repository: https://github.com/ByteHamster/MPHF-Experiments
We provide an easy to use Docker image to quickly reproduce our results.
Alternatively, you can look at the Dockerfile to see all libraries, tools, and commands necessary to compile.
Cloning the Repository
This repository contains submodules. To clone the repository including submodules, use the following command.
git clone --recursive https://github.com/ByteHamster/GpuRecSplit.git
Building the Docker Image
Run the following command to build the Docker image. Building the image takes about 10 minutes, as some packages (including LaTeX for the plots) have to be installed.
bash
docker build -t gpurecsplit --no-cache .
Some compiler warnings (red) are expected when building dependencies and will not prevent building the image or running the experiments. Please ignore them!
Running the Experiments
Due to the long total running time of all experiments in our paper, we provide run scripts for a slightly simplified version of the experiments. They run fewer iterations and output fewer data points.
You can modify the benchmarks scripts in scripts/dockerVolume if you want to change the number of runs or data points.
This does not require the Docker image to recompile.
Different experiments can be started by using the following command:
bash
docker run --interactive --tty -v "$(pwd)/scripts/dockerVolume:/opt/dockerVolume" gpurecsplit /opt/dockerVolume/<script>.sh
<script> depends on the experiment you want to run.
| Figure | Launch command | Estimated runtime |
| :------------------------------------------------------------------- | :-------------------------------------------- | :----------------- |
| Figure 3
| /opt/dockerVolume/brute-force-vs-rotations.sh | 30 minutes |
The resulting plots can be found in scripts/dockerVolume and have the file extension .pdf.
More experiments comparing GpuRecSplit with competitors can be found in a different repository: https://github.com/ByteHamster/MPHF-Experiments
Licensing
GpuRecSplit is licensed exactly like libstdc++ (GPLv3 + GCC Runtime Library Exception), which essentially means you can use it everywhere, exactly like libstdc++.
You can find details in the COPYING and COPYING.RUNTIME files.
If you use the project in an academic context or publication, please cite our paper:
@inproceedings{bez2022high,
author = {Dominik Bez and
Florian Kurpicz and
Hans{-}Peter Lehmann and
Peter Sanders},
title = {High Performance Construction of {RecSplit} Based Minimal Perfect Hash
Functions},
booktitle = {{ESA}},
series = {LIPIcs},
volume = {274},
pages = {19:1--19:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
doi = {10.4230/LIPICS.ESA.2023.19}
}
Owner
- Login: ByteHamster
- Kind: user
- Location: Germany
- Company: Karlsruhe Institute of Technology
- Website: https://www.bytehamster.com
- Repositories: 50
- Profile: https://github.com/ByteHamster
I'm a PhD student at Karlsruhe Institute of Technology. In my freetime, I maintain AntennaPod and contribute to other projects like K-9 Mail and Baikal Server.
Citation (CITATION.cff)
cff-version: 1.2.0
message: "If you use this software in an academic context or publication, please cite it as below."
authors:
- family-names: "Bez"
given-names: "Dominik"
- family-names: "Kurpicz"
given-names: "Florian"
orcid: "https://orcid.org/0000-0002-2379-9455"
- family-names: "Lehmann"
given-names: "Hans-Peter"
orcid: "https://orcid.org/0000-0002-0474-1805"
- family-names: "Sanders"
given-names: "Peter"
orcid: "https://orcid.org/0000-0003-3330-9349"
title: "High Performance Construction of RecSplit Based Minimal Perfect Hash Functions"
preferred-citation:
type: conference-paper
title: "High Performance Construction of RecSplit Based Minimal Perfect Hash Functions"
authors:
- family-names: "Bez"
given-names: "Dominik"
- family-names: "Kurpicz"
given-names: "Florian"
orcid: "https://orcid.org/0000-0002-2379-9455"
- family-names: "Lehmann"
given-names: "Hans-Peter"
orcid: "https://orcid.org/0000-0002-0474-1805"
- family-names: "Sanders"
given-names: "Peter"
orcid: "https://orcid.org/0000-0003-3330-9349"
doi: "10.4230/LIPICS.ESA.2023.19"
journal: "ESA"
year: 2023
GitHub Events
Total
- Push event: 5
Last Year
- Push event: 5
Committers
Last synced: 11 months ago
Top Committers
| Name | Commits | |
|---|---|---|
| ByteHamster | i****o@b****m | 116 |
| Dominik Bez | d****z@s****u | 2 |
Committer Domains (Top 20 + Academic)
Issues and Pull Requests
Last synced: 11 months ago
All Time
- Total issues: 3
- Total pull requests: 0
- Average time to close issues: 2 months
- Average time to close pull requests: N/A
- Total issue authors: 2
- Total pull request authors: 0
- Average comments per issue: 3.67
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Top Authors
Issue Authors
- RagnarGrootKoerkamp (1)
- meling (1)
Pull Request Authors
Top Labels
Issue Labels
Pull Request Labels
Dependencies
- actions/checkout v2 composite
- ubuntu 22.04 build