Dining philosophers problem's guide for 42 school

Philosophers is a comprehensive guide and solution to the classic Dining Philosophers Problem in computer science. This project uses the C programming language and multithreading to implement a solution that prevents deadlocks and resource conflicts.

Philosophers is a project from the 42 school curriculum that explores concurrent programming with threads and mutexes, processes and semaphores. It is a variation on the famous dining philosophers problem.

A simple POSIX threading library for MATLAB Coder

This project serves as an introduction to multithreading. The purpose was to build two different programs to solve the famous dining philosophers problem, each with different constraints.

Eat, Sleep, Spaghetti, repeat. This project is about learning how threads work by precisely timing a group of philosophers on when to pick up forks and eat spaghetti without dying from hunger.

Eat, Sleep, Spaghetti, repeat. This project is about learning how threads work by precisely timing a group of philosophers on when to pick up forks and eat Spaghetti without dying from hunger.

[ARCHIVE/2014] OS-independent utils for C++

In this project, I tackled the Philosopher's Problem. By coding the solution to this problem, I aimed to grasp the functioning and usage logic of threads in the C language, as well as learn how to effectively utilize mutexes.

Three tasks that teach how to work with mutexes, semaphores and forks.

dining philosophers problem

3 different problems solved with multithreading. University project [no.2] for Concurrent Programming (Fall 2017).

Program involving multi-threading and multi-process programming, employing mutexes and semaphores

Dining philosophers problem solved, synchronization issues...

Concurrent Programming in C (3rd year - 5th semester)

🧐 Project for Codam that utilizes multi-threading and mutexes to simulate a table of philosophers eating, sleeping and thinking

Philosophers dinner problem using threads

Philosophers tackles the "Dining Philosophers" problem, focusing on concurrency issues such as deadlock and starvation. It simulates philosophers as threads/processes using mutexes/semaphores for fork management. The program logs state changes and detects starvation, ending when a philosopher dies or all have eaten a specified number of times.

the dining philosophers problem, with the use of semaphores and threads .