Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Akka Streams: Programming Reactive Systems

Related lectures (32)

Covers the basics of concurrency, its importance, and how to write concurrent programs.

Presents an algorithm to prevent starvation and maximize philosophers eating simultaneously.

Covers the basics of atomic operations in concurrency and parallelism, including hardware-provided operations and synchronized algorithms.

Explores visibility in concurrency, memory models, shared memory, and hardware optimizations.

Explains the Sequential Consistency model in concurrency and parallelism, covering program order, atomicity, and performance implications.

Explains the Java Memory Model and thread start semantics for concurrent programs.

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Explores thread safety, synchronization, and concurrent collections in Scala, focusing on a lock-free concurrent queue implementation.

Covers the course CS206 on Parallelism and Concurrency, including logistics, materials, exercise sessions, labs, exams, and grading criteria.

Explores monitors as a synchronization construct providing mutual exclusion and cooperation among threads, with examples like the one-place buffer.

Introduces the readers-writer lock for handling concurrency in scenarios with frequent reads and occasional updates.

Covers the basics of concurrency, focusing on threads and synchronization, including thread joining and challenges of non-deterministic execution.

Covers the basics of parallelism, including physical examples, historical context, multicore era, and parallel collections in Scala.

Explores futures as a structured approach to concurrency, simplifying parallel tasks and input-output operations.

Covers the basics of parallel programming, including exploiting parallelism in algorithms and the importance of avoiding race conditions.

Explores asynchronous programming with futures, showcasing benefits, challenges, and efficient implementations.

Covers the implementation of locks using compareAndSet and the concept of fair locks.

Explores concurrency semantics, recursive functions, loops, interleaving modeling, and interpreter verification.

By the instructor Viktor Kuncak explores formal verification, program synthesis, and teaching activities at EPFL.

Explores computing p-norm using parallel programming in Scala and its impact on performance.