Philosophers Dinner Problem built in C language, using Threads/Monitors
-
Updated
Mar 8, 2017 - C
Philosophers Dinner Problem built in C language, using Threads/Monitors
Variation of the philosophers dinner concurrent problem
Implementação do Problema do Jantar dos Filósofos usando o conceito de threads e semáforos apresentados na disciplina de Sistema Operacionais.
A program written with compatibility with Posix and uses Posix Threads that runs the philosohper dinner problem using threads and mutex to prevent multiple simultaneous execution of the critical section.
🍝 Dining philosophers problem
Operating Systems course at Warsaw University of Technology assignments.
42 - Dining Philosophers problem simulation.
【42Project】"Philosophers": learn the basics of threading a process, how to make threads, discover the mutex.
In this project, I studied the basics of threads process. I learned how to make threads. I studied what semaphores and mutexes.
Philosophers dinner problem using threads
A simulation that solves the famous Dining Philosophers problem.
Dining philosophers problem on C
Simulation of the dining philosophers problem using threads and mutexes in C
42 Philosophers
Add a description, image, and links to the philosophers-dinner-problem topic page so that developers can more easily learn about it.
To associate your repository with the philosophers-dinner-problem topic, visit your repo's landing page and select "manage topics."