search

thomasrolinger / chapel

a Productive Parallel Programming Language
https://chapel-lang.org
Other
0 stars 0 forks source link

Large Application Experiment #44

Closed thomasrolinger closed 1 year ago

thomasrolinger commented 1 year ago

We should put together a “workflow” that does a few different graph kernels and show how our optimizations work.

Something like construct the graph from an edge list, do a BFS to get ordering/extraction of some nodes and then a PageRank on those nodes. Maybe we can put some other stuff in there, as long as it makes some sort of sense. Maybe PageRank first and then BFS on graphs of nodes that have a certain PageRank value?

thomasrolinger commented 1 year ago

I did this and gathered the results. It does graph construction, PageRank and then SSSP from the top 5 vertices.