Closed buddha314 closed 6 years ago
Bruce said this was a good idea...
It appears there is a C++ OpenMPI graph library called graph-tool that might be useful as well.
Now that @bradcray is back from vacation, I want to annoy him by bumping this ticket.
@buddha314 stinger is a pretty unique solution. it's been a couple years since i've looked at the source but, from what i remember, stinger is implemented under a client/server model. the server maintains a highly specialized graph data structure in shared memory. graph algorithms accessing the stinger data structure are implemented as client applications which lock that server managed shared memory structure to perform a graph algorithm. when the computation is completed, the application unlocks the shared memory data structure and the server continues business as usual. the publication history is interesting and worth reviewing.
I don't know much about it, thanks for the link. I'm just looking for the fastest way to interact with distributed graphs from chapel. I'd like something that allows me to pull an adjacency matrix, not really a database. I'd love to hear more of your opinions on that!
John Leidel from Tactical Computing Labs pointed me to the GraphBLAS C API that would be instructive in building the Chapel version.
Apparently some people are using Giraph at Facebook, and they published a comparison of Giraph and GraphX . I have used GraphX and I am not a fan.
Just came across an early presentation on Pregel and GraphX briefly describing some algorithms.
Inspired by several presentations, including Azad & Buluc, graphBlas and the field of Algebraic Graph Theory, we could really use a systemic treatment of graphs within Chapel, along with the associated matrices.