We implemented Johnson's Algorithm for all-pairs shortest path from scratch using OpenMP and CUDA. We also measured and analyzed the performance improvements in different parts of the program and on graphs with different number of nodes and different graph densities. Our OpenMP implementation achieved a best speedup of 6.97x on GHC machines. Our CUDA implementation achieved a best speedup of 16.37x on GHC machines.
-
Notifications
You must be signed in to change notification settings - Fork 0
fangzhouxie/spring2020_15618_project
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Parallel Johnson’s Algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published