-
Notifications
You must be signed in to change notification settings - Fork 8
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
Support of data structs binding on V/E layer #1
Comments
Thanks for your interests in Lux! I am not sure if I fully understand what do you mean by |
@jiazhihao - thanks for prompt answer. I actually didn't yet compile and looked in more detail in API, but I already looked at Legion and other GASNe yesterday :-) very nice stuff. I discussed similar topic with guys from GUNROCK team: Also guys from GUNROCK actively participate in newly released project by NVIDIA and its partners RAPIDS platform which resulted in sub-project: .... these are just information for you if you are not aware yet :-) But back to my question (from gunrock issue): Scenario: Now I would like to search in such structure for SHORTEST PATH trough edges where property=USE THIS PATH. Can I achieve such effect with Lux at moment? This is to to demonstrate real world benchmark. Also more details on similar discussion you can find at referenced issue from GUNROCK project, especially I discuss the idea of Mega-KV project integration potential for efficient large data binding to N/E in graph structures on GPU. |
@archenroot Thanks for the references. Yes, Lux can support your scenario. If the edge properties are USE or DONT USE, a simple solution would be treating the edge value as 1 and infinite in the SSSP example. You can also define any complex data structure along with edges/nodes. We also have a collaborative filtering example whose nodes' properties are vector representations. |
Hello,
this work looks superior, going to run some stuff on and test it. Especially against GUNROCK project.
Q: Do you think about supporting binding data structs to V/E, which can be used to limit/restrict traversal algorithms implemented?
The text was updated successfully, but these errors were encountered: