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
Naive distributed computing requires the following things:
A SPSC channel
A MPSC channel
Finding peers
Thanks to our message-passing based design, we should be able to reuse large part of the code though some hierarchical work-stealing probably needs to be introduced.
For distributed computing, the SparseSet introduced in #15 is too memory hungry.
It can be replaced by succinct data structure. Constant-time rank support for succinct data structure (which requires a bit of overhead over the bitset) is the subject of in-depth research.
Naive distributed computing requires the following things:
Thanks to our message-passing based design, we should be able to reuse large part of the code though some hierarchical work-stealing probably needs to be introduced.
See Thesis for MPI based channels
Further distributed channel alternatives could be ZeroMQ, see presentation: http://irpf90.ups-tlse.fr/files/oslo_zmq.pdf
and Nanomsg which is MIT-licensed https://github.com/nanomsg/nng see writeup: https://nanomsg.github.io/nng/RATIONALE.html
The text was updated successfully, but these errors were encountered: