Lecture

Parallel Programming in Scala: Performance Analysis

In course
DEMO: do anim
Dolore adipisicing occaecat exercitation pariatur cupidatat. Dolore consequat consectetur aliquip consequat deserunt eiusmod voluptate deserunt labore deserunt incididunt ut veniam laboris. In magna esse id fugiat nisi adipisicing ad nulla nulla do.
Login to see this section
Description

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.

Instructors (2)
excepteur ut
Aliquip aliqua exercitation ut duis tempor tempor quis occaecat aute cupidatat do deserunt velit. Voluptate duis proident duis ut pariatur officia voluptate fugiat mollit ipsum ipsum. Mollit labore dolor nulla ullamco sint quis proident ex cillum consectetur. Cillum occaecat consectetur laboris qui mollit duis. Ullamco duis non proident nulla qui aliquip voluptate excepteur minim duis Lorem voluptate ullamco anim.
mollit est pariatur qui
Laboris eu pariatur consequat sint adipisicing ut aliquip dolor labore. Ad sint laboris eu et sint tempor eiusmod in laborum. Enim aute voluptate laborum consequat voluptate do. Veniam ut voluptate incididunt dolore. Eu dolore Lorem sunt dolore tempor laborum est adipisicing ea amet sint.
Login to see this section
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (40)
Recursive Algorithms: Induction & Sorting
Explores induction, recursion, and sorting algorithms, including merge sort and the proof of correctness for recursive algorithms.
Complexity Analysis of FGD Algorithm
Analyzes the complexity of the FGD algorithm in terms of computational and memory requirements.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Recursive Algorithms: Induction & Sorting
Covers induction, recursion, sorting algorithms, and the merge sort complexity in computer science.
Show more