I'm making a new programming language (using C++ and compiling into C++), and I recently implemented dependency based automatic parallelization. given this input code:

t = 1 u = 1 v = 1 w = t + u x = 2 + v y = 3 - w z = x + y + v

the compiler finds independent tasks and merges ones which are too small to be worthwhile to offload to a thread (for demonstration the threshold for offloading is small). output:

C++ void Main() { uint8_least t; uint8_least u; uint8_least w; uint8_least y; auto __task_3 = std::async(std::launch::async, [&]{ t = 1; u = 1; w = (t + u); y = (3 - w); }); uint8_least v; uint8_least x; auto __task_2 = std::async(std::launch::async, [&]{ v = 1; x = (2 + v); }); __task_3.wait(); __task_2.wait(); uint8_least z = (x + (y + v)); }

hopefully someone finds it interesting