Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of fold (reduce) operations in parallel programming using Scala. It explains the meaning and properties of fold, associative operations, trees for expressions, folding (reducing) trees, parallel reduction of trees, and the order of elements in a tree. The lecture also delves into how to compute the value of expression trees, the parallel reduction of a tree, and the associativity of trees. It concludes with a discussion on reduction for arrays and parallel array reduction.