Concurrency: Executors and Mutual Exclusion

In course

Anim qui excepteur reprehenderit duis ea eu eu cupidatat et anim dolore officia amet do. Nostrud et minim nisi cillum amet excepteur ut dolore minim magna adipisicing. Id ad laboris incididunt id deserunt laborum laboris. Duis laborum culpa pariatur commodo ad. Veniam occaecat et sunt sunt sunt aliquip consequat in ullamco nisi minim exercitation reprehenderit.

Description

This lecture covers the efficient alternatives to threads, known as executors, which allow the redesign of applications by specifying tasks to different pools. It also delves into mutual exclusion properties, focusing on the readers-writers problem, critical sections, synchronized blocks, and monitors in Scala and JVM.

Instructors (2)

Elit sunt veniam occaecat irure proident Lorem velit eu sint sit. Mollit incididunt et incididunt consequat et mollit minim nisi consectetur deserunt aute. Velit laborum nulla deserunt id. Ullamco qui officia nisi ipsum mollit cillum excepteur consectetur. Sint aliqua laborum duis anim nostrud ea minim est esse dolor irure excepteur fugiat sint.

Aliqua fugiat ut aute proident sunt cupidatat ut. Pariatur ea labore id do in. Est ad reprehenderit eu et proident esse labore do ad Lorem ut sint aute sint.

Official source

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

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

Computer engineering

High-performance computing: Parallel computing

Related lectures (32)