data-races

Often referred to as the Dining Philosophers Problem, is a classical synchronization problem that explores the challenges of resource sharing and deadlock avoidance.

Project that simulates the classic dining philosophers problem. It focuses on concurrent programming using threads and mutexes to manage resource sharing, prevent deadlocks and data races, and ensure synchronization among multiple processes.

Multithreading, Mutexes, and Synchronization in C

the best static race detector for Java

Philosophers is a classic concurrency programming project from 42 School. The goal is to simulate the behavior of philosophers sitting at a table, alternating between thinking, eating, and sleeping, while correctly managing concurrency and shared resources (the forks).

Reproducible data-race scenarios in Go (1.26), based on the Uber blog post: Data Race Patterns in Go.