las3_pub / predictable_parallel_patterns

It is now possible to use a memory mapped stack that throws a SIGSEV if thes coroutine stacks are exhausted.

Remove the strict static memory allocation scheme in favour of placing objects on the heap at startup. This still keeps the requirements posed for modern, high performance embedded systems, but makes APIs a lot cleaner.

This first sketch of the classes captures what we think is needed in terms of general interface and very mich WIP.

This might allow us to do lock free, conditional waits in our stealing loop.

We separated the structure (input-output flow) from the rest of the architecture and reworked some template programming to have better access to the types required at compile time.

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

The __thread implementation of thread local, static variables seems more efficient, so we activate this by default. If it is (for some reason) not available/slower than the pthread version, one can toggle it for the specific system/processor later on using macros.

Right now no work can be spawned, we simply have a proove of concept that we start up each thread, work for the master to finish and then synchronize back to the main thread.

We force linker errors if the new operator is used somewhere. See NOTES.md for details.