Dining Philosophers Problem

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Page 1 of 4

Dining philosopher problem

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

Introduction to Concurrency

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

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.

Sequential consistency: Basic Concepts

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

Akka Streams: Programming Reactive Systems

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

Transactions: Concepts and Implementations

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

Parallelism and Concurrency

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

Concurrency and Parallelism: Queue

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

Memory Models: Visibility and Semantics

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