M.Sc. Tim Niklas Uhl
- Room: 221
- Phone: +49 721 608-43564
- Fax: +49 721 608-43088
- uhl ∂does-not-exist.kit edu
- github.com/niklas-uhl/
Software
- KaMPIng - (Near) zero-overhead MPI wrapper for modern C++
- KaTric - scalable distributed-memory triangle counting
- Message Queue - an asynchronous buffering message queue for MPI
Publications
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Uhl, T. N.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 289–291, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660260
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Uhl, T. N.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 289–291, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660260
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Stelz, C.; Uhl, T. N.
2024. arxiv. doi:10.48550/arXiv.2404.05610
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Stelz, C.; Uhl, T. N.
2024. arxiv. doi:10.48550/arXiv.2404.05610
Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076
Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. doi:10.48550/arXiv.2302.11443
Sanders, P.; Uhl, T. N.
2023. doi:10.48550/arXiv.2302.11443
Communication Efficient Triangle Counting. master’s thesis
Uhl, T. N.
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150358
Uhl, T. N.
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150358
Faster and better nested dissection orders for Customizable Contraction Hierarchies
Gottesbüren, L.; Hamann, M.; Uhl, T. N.; Wagner, D.
2019. Algorithms, 12 (9), Art.-Nr.: 196. doi:10.3390/a12090196
Gottesbüren, L.; Hamann, M.; Uhl, T. N.; Wagner, D.
2019. Algorithms, 12 (9), Art.-Nr.: 196. doi:10.3390/a12090196
| Title | Conference | Date |
|---|---|---|
| (Near) Zero-Overhead C++ Bindings for MPI | SPAA 2024 |
Juni 2024 |
| Engineering a Distributed-Memory Triangle Counting Algorithm | IPDPS 2023 |
Mai 2023 |
| Title | Type | Semester |
|---|---|---|
| Proseminar Algorithm Engineering | Proseminar (PS) | SS 2024 |
| Parallele Algorithmen | Vorlesung (V) | WS 23/24 |
| Parallele Algorithmen - Von Theorie zu Praxis | Proseminar (PS) | SS 2023 |
| Visualisierung von Graphalgorithmen | Praxis der Softwareentwicklung | WS 22/23 |
| Parallele Algorithmen | lecture | WS 22/23 |
| Parallele Algorithmen - Von Theorie zu Praxis | proseminar | SS 2022 |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Scalable Fault-Tolerant MapReduce | Fault-Tolerance, Map Reduce, HPC | offen |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Speedup Techniques for Irregular Sparse All-to-All | Kommunikationalgorithmen, verteilte Graphalgorithmen | ||
| Development and Evaluation of a Parallel Model Merging Algorithm Based on the PREEvision Use Case | Patrick Fetzer |
||
| Distributed List-Ranking Algorithms | Distributed Graph Algorithms | ||
| Engineering Asynchronous Label Propagation for Multilevel Graph Partitioning | Graph Partitioning | Daniel Seemaier Tim Niklas Uhl |
Samuel Gil |