Introduction to Concurrency

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Dining philosopher problem

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

Atomic Operations: Basics and Applications

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

Concurrency and Parallelism: Visibility

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

Akka Streams: Programming Reactive Systems

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

Sequential consistency: Basic Concepts

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

Dining Philosophers Problem

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Parallelism and Concurrency

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

Memory Models: Visibility and Semantics

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

Concurrency and Parallelism: Queue

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

Readers-writer Lock

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

Concurrency Basics: Threads and Synchronization

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

Parallel Programming: Fundamentals

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

Monitors: Synchronization and Cooperation

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

Concurrency Semantics and Verification

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

Locks: Implementing Concurrency Mechanisms

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

Formal Verification and Program Synthesis

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

Asynchronous Programming: Callbacks and Failures

Covers the concept of asynchronous programming and how to handle dependencies and failures.

Concurrency with Futures

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

Transactions: Concepts and Implementations Log in to Mediaspace to watch this video

Explores the significance and challenges of transactions, emphasizing ACID properties and the practical implications of using transactional memory for concurrency control.

Concurrency Control & Recovery in Databases Log in to Mediaspace to watch this video

Delves into transaction management, concurrency control, and recovery in databases to ensure data integrity and system resilience.

Page 1 of 2