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 explores the performance analysis of parallel programs in Scala, focusing on empirical measurement and asymptotic analysis to estimate computation time. It covers the asymptotic analysis of sequential running time, recursive functions with unbounded parallelism, and the implications of Amdahl's Law on parallelism. The instructor discusses the concepts of work and depth in parallel code, rules for depth and work calculations, and computing time bounds for given parallelism, providing insights into the behavior of parallel programs with varying levels of parallel threads.