You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
BFS benchmark applicability: hop() seems to correspond to Graph500 BFS, afaict . The benchmark may frown on the extreme parallelism GFQL unlocks, but that seems OK for now? We should investigate
We should benchmark T4 (cheap gpu) + some sort of modern GPU with bigger memory + more cores
I'd be curious about the impact of some sort of UVM for bigger-than-memory operation before resorting to dask_cudf etc . E.g., how do the GTEPS/MTEPS look once we're bigger than memory?
We should check if any other benchmarks seem applicable as well
Writeup:
executable script
that generates a valid benchmark submission
that generates charts
ipynb for lightweight use
and a blogpost :)
The text was updated successfully, but these errors were encountered:
Is your feature request related to a problem? Please describe.
GFQL can likely do decently on Graph500. Worth having code + writeup
It may be worth taking a quick look at https://ldbcouncil.org/ as an alternative as well
Describe the solution you'd like
Benchmark:
hop()
seems to correspond to Graph500 BFS, afaict . The benchmark may frown on the extreme parallelism GFQL unlocks, but that seems OK for now? We should investigateWriteup:
The text was updated successfully, but these errors were encountered: