Dining philosopher problem

Related lectures (32)

Page 1 of 4

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

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

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

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

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

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

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

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

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

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