> cat ./posts/thesis/*.md
Thesis: heavy weight perfect matching on the GPU
Implementing the Heavy Weight Perfect Matching Algorithm for bipartite graphs on the GPU — M.Sc. research in HPC & Algorithms at the University of Bergen.
- [thesis]
Sample 2 - Baseline auction bidding kernel — first numbers
A naive one-thread-per-vertex bidding kernel, where it stalls, and the coalescing fix that followed.
- [thesis]
Sample 3 - Thesis kickoff — heavy weight perfect matching on the GPU
Framing the problem, why the sequential auction/Hungarian family stalls, and the target for a GPU implementation.