A new Deadlock avoidance algorithm is created using C language which when compared is more efficient than the Bankers algorithm
-
Updated
Feb 22, 2021 - C
A new Deadlock avoidance algorithm is created using C language which when compared is more efficient than the Bankers algorithm
Implementation of the **Dining Philosophers Problem** in C, demonstrating multithreading, synchronization, and concurrency. The simulation manages philosophers sharing forks and avoids issues like deadlock and starvation.
Dive into KernelSpinLocks: A repository with comprehensive guides & examples on Linux Kernel spinlocks, exploring methods, implementation, and crucial considerations in multi-threading scenarios
The "Philosophers" project at 42 is a programming exercise based on Edsger Dijkstra's dining philosophers problem. Students simulate philosophers alternating between thinking and eating, sharing forks, and managing concurrent resource access to avoid deadlocks and ensure proper synchronization.
All Assignments done for the Operating Systems Course in 2021. Includes codes done on Kernel Programming, Creating System Calls, Kernel Semaphores, Changing the Linux Scheduler & the Producer Consumer Problem in Kernel Space.
Spacecraft control using POSIX-threads API
Add a description, image, and links to the deadlock-prevention topic page so that developers can more easily learn about it.
To associate your repository with the deadlock-prevention topic, visit your repo's landing page and select "manage topics."