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

Lecture

Memory Models: Visibility and Semantics

Related lectures (32)

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

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

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

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

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

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

Introduces thread creation and management in Java, including using thread pools for efficient task execution.

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

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

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

Explores volatile variables in Java for concurrent programming and synchronization importance.

Covers Akka Streams basics, stream stages concurrency, materialized values, and more.

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

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Covers the concept of deadlock in concurrent programming and provides solutions to prevent them.

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

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

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

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

Covers the thread abstraction in computer systems, focusing on concurrency, parallelism, and the management of threads using the POSIX API.