Serializing and deserializing through sockets seems to have the same performance as using remote references. Doesn't seem to make sense to use sockets (remote refs are built on them, and its probably better to rely on the jula/mutli.jl implementation).
Also, need to squeeze in adjacency lists into the vertex structures themselves. This will make vertex iterations much more simple.
Finally, need a way to load messages in a distributed manner instead of having to distribute it from the main proc.
Need to start development of Wiki also.
Todo:
[ ] Create "worker handles" for each process that store all process related information. This can be backed up for check pointing.
[x] Create global variables for message passing components.
[x] Setup all-to-all registrations. (A registration involves exchanging remote references or endpoints)
[x] Modify vertex definition to include forward and backward adjacency lists.
[ ] Setup an operation for distributed back-adjacency calculation.
[ ] Figure out how to enforce barrier synchronization.
Serializing and deserializing through sockets seems to have the same performance as using remote references. Doesn't seem to make sense to use sockets (remote refs are built on them, and its probably better to rely on the
jula/mutli.jlimplementation). Also, need to squeeze in adjacency lists into the vertex structures themselves. This will make vertex iterations much more simple. Finally, need a way to load messages in a distributed manner instead of having to distribute it from the main proc. Need to start development of Wiki also.Todo:
cc @rohitvarkey