las3_pub / predictable_parallel_patterns

This is the base building block for creating the actual dataflow functions and networks, as their main functionality is having data flow through connected nodes.

Threads must be joined on scheduler termination and tasks must be pushed onto the stack to allow better memory management.

This removes boost as an dependency from our code and makes our project
again only dependent on C++11 compilers (no external dependency).

Now all algorithms are used without the parallel pre-/suffix and the for_each method has an specialization for integer ranges.

This seems to be only possible with two different function names, as variadic arguments and default arguments wont work together.

See the comment in the source. This race should actually not be important, but we fix it anyways for now to make the CI happy.

This should have been fine without the atomic property (as it is only a single writer and multiple readers to a single bit). Nevertheless we fixed the 'race' to remove a warning in the thread sanitizer.

This was highlighted as an issue in the steal_work routine, as frequent calls to virtual functions are expensive.

Please note that this does currently not execute, but only removed the 'old aspecs'. We are still missing launching the root fork_join task.

This is required to correctly execute multiple, consecutive wait_for_all calls in one fork_join_sub_task.