https://github.com/caglakahriman/dining-philosophers

Algorithm to solve the dining philosophers problem, written in C
https://github.com/caglakahriman/dining-philosophers

Last synced: 5 days ago
JSON representation

Algorithm to solve the dining philosophers problem, written in C

• Host: GitHub
• URL: https://github.com/caglakahriman/dining-philosophers
• Owner: caglakahriman
• Created: 2022-12-26T13:11:05.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2022-12-26T13:21:34.000Z (almost 2 years ago)
• Last Synced: 2023-09-18T13:27:28.691Z (about 1 year ago)
• Language: C
• Size: 3.91 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Dining-Philosophers

Algorithm to solve the dining philosophers problem, written in C

"In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them."

Problem statement:

There is a fork between each plate. The dish served is a kind of spaghetti which has to be eaten with two forks. Each philosopher can only alternately think and eat. Moreover, a philosopher can only eat their spaghetti when they have both a left and right fork.

On this project I,

- handle multiple [threads](https://www.ibm.com/docs/en/cobol-zos/6.3?topic=multithreading-),

- handle multiple [mutexes](https://www.ibm.com/docs/en/i/7.1?topic=threads-mutexes),