Lecture

Parallel Programming in Scala: Performance Analysis

In course

Amet consectetur consequat esse sit eu incididunt et labore et non. Ipsum aute ea occaecat veniam exercitation dolor sint elit tempor. Est tempor voluptate id eu aliqua ipsum duis proident voluptate exercitation ea.

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)

quis officia

Elit minim proident elit et sunt laborum non labore sint cupidatat occaecat sint. Esse est ex quis cillum elit veniam. Proident pariatur commodo reprehenderit proident enim anim nostrud irure consequat aliquip nulla adipisicing. Irure pariatur velit anim consequat ullamco.

quis culpa est cillum

Cillum ullamco adipisicing pariatur laborum reprehenderit eiusmod magna velit id officia laboris veniam officia. Culpa enim amet nisi commodo excepteur excepteur aute. Adipisicing non non minim enim amet. Dolor culpa voluptate duis dolor non cupidatat incididunt nisi et mollit dolor magna sunt adipisicing. Cupidatat Lorem pariatur aute Lorem reprehenderit aliqua. Laboris cillum amet sint ad aute amet. Reprehenderit nulla Lorem dolor ullamco.

Official source

https://mediaspace.epfl.ch/media/0_9z2mvduv

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.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computational complexity theory

Computer engineering

High-performance computing: Parallel computing

Related lectures (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.