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

Concept

Concurrency (computer science)

Related lectures (31)

Introduction to Concurrency

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

Concurrency Semantics and Verification

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

Concurrency with Futures

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

Parallel Computation: Tasks

Explores parallel computation using tasks for concurrent execution and demonstrates their implementation in practice.

Concurrency: Deadlock

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

Concurrent Stack: Implementation

Explains the reference implementation for a concurrent stack and the importance of handling concurrency issues.

Concurrency Basics: Threads and Synchronization

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

Dining philosopher problem

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

One place buffer: Producer-consumer queue

Introduces the concept of a one-place buffer in concurrent programming.

Asynchronous Programming with Futures

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

Concurrency Overview

Explores the significance of concurrency in enhancing system performance and responsiveness, emphasizing the need for synchronization and atomicity to prevent race conditions and non-determinism.

Akka Streams: Programming Reactive Systems

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

Atomic Operations: Basics and Applications

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

Asynchronous Programming: Callbacks and Failures

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

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.

One-place Buffer: Monitor-based Implementation

Discusses the implementation of a one-place buffer using monitors in a concurrent environment.

Parallel Programming: Fundamentals

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

Locks: Implementing Concurrency Mechanisms

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

Message Processing Semantics

Explores the principles of reactive programming and message processing semantics in Akka, emphasizing actor encapsulation, reliable messaging, and message delivery guarantees.