philosophers-problem

Automated testing framework for multi-threaded C applications. Validates mutex locking logic, detects deadlocks, and benchmarks timestamp accuracy.

The classic dining philosophers problem 🍽️ simulates concurrent philosophers competing for forks, illustrating synchronization techniques to prevent deadlocks, starvation, and race conditions.

The project implements a multi-threaded solution to the classic dining philosophers problem.