A commented example of solving the dining philosophers multithreading problem.
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
Sergiotarxz b38a2c76c6 Fixing typo. 1 month ago
include Fixing typo. 1 month ago
src Fixing typo. 1 month ago
Doxyfile Adding first commit. 1 month ago
LICENSE Initial commit 1 month ago
README.md Fixing typo. 1 month ago
meson.build Adding first commit. 1 month ago

README.md

dining-philosophers

A commented example of solving the dining philosophers multithreading problem.

Description of the dining philosophers problem.

The dinner philosophers problem consists of a round table where N number of philosophers are seated, every philosopher has a fork on each side that they are supposed to share with their neighbors to eat a spaghetti that can only eated by the usage of two forks.

The problem consists on achieving the table to be able to continuously eat without getting stuck in a deadlock without the chance of philosophers to talk between themselves.

Description of the solution.

For the solution I inspired on the Dijkstra's solution but using the OOP nature of C++ to make it more readable and near to the natural language.

The code is commented in its tricky parts in order to make the solution easier to understand.

https://en.wikipedia.org/wiki/Dining_philosophers_problem