ck VS HPX

There are plenty of practical solutions to the safe memory reclamation problem in C. The language just doesn't force one on you.

From epoch-based reclamation (https://github.com/concurrencykit/ck/blob/master/include/ck_..., especially with the multiplexing extension to Fraser's classic scheme), to quiescence schemes (https://liburcu.org/), or hazard pointers (https://github.com/facebook/folly/blob/master/folly/synchron..., or https://pvk.ca/Blog/2020/07/07/flatter-wait-free-hazard-poin...)... or even simple using a type-stable (https://www.usenix.org/legacy/publications/library/proceedin...) memory allocator.

In my experience, it's easier to write code that is resilient to hiccups in C than in Java. Solving SMR with GC only offers something close to lock-freedom when you can guarantee global GC pauses are short enough... and common techniques to bound pauses, like explicitly managed freelists land you back in the same problem space as C.

ck - Concurrency primitives, safe memory reclamation mechanisms and non-blocking data structures. BSD-2-Clause

Indeed they do, https://github.com/concurrencykit/ck

https://github.com/STEllAR-GROUP/hpx Modern C++ concepts incorporated in a threading library. Lots of useful techniques used in there and we are trying to keep our code base very tidy. Feel free to chime in our libera channel #ste||ar if you have any questions.

https://github.com/STEllAR-GROUP/hpx Welcoming community + we have been part of GSoC for 4-5 years now so feel free to apply there when it opens ;)

I found this interesting library that might fit your goal.

I personally like the ideas in Parallelism v2 TS, which is available in for libstdc++ 11 onwards. The reference implementation is a library named Vc (afaik Vc is the most popular SIMD library for C++), and this has also been implemented in recent versions of HPX.

I am aware of DAGs of task based threading library like Taskflow and HPX however the benefit they have is not obvious to me, as the following sequential section depends on the parallel part being completed fully. If you want to suggest elaboration on the benefits of this approach would be welcome.

Github: https://github.com/STEllAR-GROUP/hpx

We're working on something similar, but based on sender/receiver in HPX (a lightweight threading runtime) and DLA-Future (distributed linear algebra currently based on (HPX) futures; based on sender/receiver in the future). With senders-as-awaitables this would also get you coroutine support for asynchronous MPI calls for free. We don't have that yet, but it's planned. In the meantime libunifex should be able to fill in the gaps.

I come from a group called STE||AR where we develop HPX, "a C++ Standard Library for Parallelism and Concurrency".