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

A Linux kernel module playground exploring synchronization mechanisms like mutexes and read-write locks, using practical code snippets and detailed notes.

This OpenCv project is built using C++ concurrency concepts such as threads, tasks, promises and futures, mutexes and locks and condition variables. The project also implements Monitor Object design pattern.