dead-lock
Here are 9 public repositories matching this topic...
To whom it may concern
- Updated
Dec 20, 2019 - Java
银行家算法示例
- Updated
May 6, 2023 - C#
A project learning about threading and mutexes in C
- Updated
Jan 20, 2025 - C
The Philosophers project, part of the 42 curriculum, simulates the classic Dining Philosophers problem to teach concurrent programming and synchronization. It involves managing resource sharing among philosophers using threads, mutexes, and semaphores to prevent deadlock and ensure efficient operation.
- Updated
May 18, 2024 - C
The Dining Philosophers problem is a classic synchronization problem in computer science that illustrates challenges in concurrent programming.
- Updated
May 25, 2023 - Go
All codes related with Operating System are available here like (Dead look, Banker's Algorithm,System call (),Process Synchronization, Disk scheduling and others necessary algorithm)
- Updated
Nov 13, 2024 - C++
This project is about creating a dinning table of n philosophers with n/2 forks. The challenge is to implement an efficent process, that enable all philosophers get to think-eat-sleep within given amount of time. No one should die if the amount of time if adequate.
- Updated
Jul 14, 2024 - C
Improve this page
Add a description, image, and links to thedead-lock topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thedead-lock topic, visit your repo's landing page and select "manage topics."