las3_pub / predictable_parallel_patterns

This showcases the expected performance when a task executes a sub-tree without inference from other threads. We target to stay about 6x slower than a normal function call.

The scheduler yields if it failed to steal any work due to the task
lists being empty. This should improve performance on multiprogrammed
systems, as it potentially makes room for other worker threads which
still have work to perform.

This allows the stack and deque class to use the same offset, making it work better with each other.

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

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

We do this to properly separate the cache alginment logic in the next step, allowing us to port all cache aligned objects without worrying about portability.

This will be used for storing thread tasks aligned in continous memory, allowing different theads to work on the data without interfearing.