Lecture

Concurrency with Futures

Description

This lecture introduces the concept of futures as a structured approach to concurrency, contrasting with the complexities of shared mutable variables and threads. It covers the use of futures for running tasks in parallel, handling input-output operations without blocking, and managing errors during computation. The lecture also explores the relationship between futures and the data-flow model of computation, where tasks are described as nodes in an acyclic graph. Practical examples and implementations using Scala are provided, showcasing how futures can simplify concurrency tasks and improve performance.

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.