Parallel A* routing
A project I especially enjoyed at Carnegie Mellon: a C++ vehicle-routing simulator that parallelizes A* searches across vehicles with OpenMP. The OpenMP version achieved roughly 6× speedup over the sequential baseline in our benchmarks on 4,096-node graphs. The project also included a CUDA implementation, route validation, and cache profiling.
