Distributed computing

[mratsim]

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.

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

[mratsim]

Very interesting paper to hide latencies in distributed work-stealing: http://reports-archive.adm.cs.cmu.edu/anon/2016/CMU-CS-16-112R.pdf

This might also help with IO latencies (#22 )

[mratsim]

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.