Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Investigate GPU processing for PathSearch #77

Open
e-lo opened this issue Jul 5, 2017 · 0 comments
Open

Investigate GPU processing for PathSearch #77

e-lo opened this issue Jul 5, 2017 · 0 comments

Comments

@e-lo
Copy link
Member

e-lo commented Jul 5, 2017

GPUs specialize in massively parallel computations, but are memory constrained.

There is a python library to use: https://mathema.tician.de/software/pycuda/

Some papers on using CUDA for graph searches:

http://cvit.iiit.ac.in/papers/Pawan07accelerating.pdf

Due to the restriction of memory on the CUDA device,
graphs above 12 million vertices with 6 degree per vertex cannot be handled using
current GPUs.

Obviously the degree here doesn't work in our favor...but it is probably a balance between that and vertices.

https://arxiv.org/abs/1002.4482

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant