42cursus-Dinnig-Philosophers

42cursus-Dinnig-Philosophers

yomazini

multithreading and resource management in C. This project solves the classic "Dining Philosophers problem" by implementing a simulation where philosophers (threads) must acquire forks (mutexes) to eat without deadlocking or starving. It's a fundamental exercise in concurrent programming and synchronization.

2 Stars
0 Forks
2 Watchers
C Language
53.9 SrcLog Score
Cost to Build
$38.4K
Market Value
$20.8K

Growth over time

3 data points  ·  2025-09-20 → 2026-04-21
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about 42cursus-Dinnig-Philosophers

Question copied to clipboard

What is the yomazini/42cursus-Dinnig-Philosophers GitHub project? Description: "multithreading and resource management in C. This project solves the classic "Dining Philosophers problem" by implementing a simulation where philosophers (threads) must acquire forks (mutexes) to eat without deadlocking or starving. It's a fundamental exercise in concurrent programming and synchronization.". Written in C. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone 42cursus-Dinnig-Philosophers

Clone via HTTPS

git clone https://github.com/yomazini/42cursus-Dinnig-Philosophers.git

Clone via SSH

[email protected]:yomazini/42cursus-Dinnig-Philosophers.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the 42cursus-Dinnig-Philosophers issue tracker:

Open GitHub Issues