Asynchronous Message-Driven Graph processing using HPX-5.
-
Updated
Jan 23, 2024 - C
#
hpx
Here are 2 public repositories matching this topic...
Conducted a comparative analysis on scaling results for graph algorithms like single source shortest path (SSSP) algorithm using multiple runtime systems thereby reducing time to solution for graph processing with message driven runtime systems (like Charm++, HPX5), parallel boost graph library, or Graph500
-
Updated
Sep 16, 2018 - C
Improve this page
Add a description, image, and links to the hpx topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the hpx topic, visit your repo's landing page and select "manage topics."