https://github.com/buraktalhaa/diningphilosophers
A solution to the famous Dining Philosophers problem using the Token Ring approach.
https://github.com/buraktalhaa/diningphilosophers
algorithm dining-philosophers dining-philosophers-problem python semaphore synchronization token-ring
Last synced: 6 days ago
JSON representation
A solution to the famous Dining Philosophers problem using the Token Ring approach.
- Host: GitHub
- URL: https://github.com/buraktalhaa/diningphilosophers
- Owner: Buraktalhaa
- Created: 2023-12-23T13:08:52.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-06T09:06:45.000Z (over 1 year ago)
- Last Synced: 2025-09-14T04:38:23.623Z (about 1 month ago)
- Topics: algorithm, dining-philosophers, dining-philosophers-problem, python, semaphore, synchronization, token-ring
- Language: Python
- Homepage:
- Size: 265 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
DINING PHILOSOPHERS PROBLEM WITH TOKEN RING SOLUTION
Hello, I'm Burak. This project contains a token ring solution in Python for solving the Dining Philosophers Problem. The Dining Philosophers Problem is a classic synchronization problem that simulates a group of philosophers sitting around a table, thinking and eating. Each philosopher shares two forks with their neighbors, left and right.