dead-lock

Official Divine Wiki for modding games made by modders for modders.

To whom it may concern

Python DeadLock Detector

Z-LoK Releases and builds

This project aims to teach concurrent programming, focusing on multithreading and multiprocessing.

银行家算法示例

The Dining Philosophers problem is a classic synchronization problem in computer science that illustrates challenges in concurrent programming.

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.

Simulation of Banker's Algorithm in C for OS

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)

A project learning about threading and mutexes in 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.

Implementation and simulation of operating system concepts, including concurrency, multithreading, mutexes, semaphores, deadlocks, process synchronization, and scheduling algorithms.