Free the Conqueror! (Refactoring divide-and-conquer functions) – Tamás Kozsik (Lambda Days 2017) – YouTube
http://www.lambdadays.org/lambdadays2017/tamas-kozsik Functions implementing divide-and-conquer algorithms are good candidates for parallelization. Their identifying property is that such a function divides its input into “smaller” chunks, calls itself recursively on these smaller chunks, and combines the outputs into one. Last year I gave a talk on how such functions can be identified by static source code analysis. This year I explain how divide-and-conquer functions can be tr ...