🧶 multithreading on the example of dining philosophers problem
-
Updated
Aug 16, 2021 - C
🧶 multithreading on the example of dining philosophers problem
Course assignment for MTL458-OS
This is a solution to the dining philosophers problem in C using pthreads and semaphores.
This repo contains Operating Systems Lab Programs that are useful for Undergraduate Students
A deadlock-free solution to the Dining Philosophers Problem using synchronization primitives in C
FIT IOS 2. project centered around deadlocks
This is a simple (it doesn't have some necessary checks) implementation of the banker algorithm for deadlock avoidance
Solutions to prevent deadlock condition in the classic Dining Philosophers Problem
Deadlock avoidance (resource management) project for Operating Systems class
In this repository you will find the basic and simple Operating System related exercises. I will be helpful to get to know how Operating System works on processes, memory management ,etc
Banker's Algorithm is used majorly in the banking system to detect and avoid deadlock.
Simulation of Banker's algorithm for deadlock avoidance
Implementation of scheduling algorithms (Round Robin, SJF, Priority, FCFS) and deadlock avoidance algorithm(Banker's Algorithm)
Basic operating system concepts in c language.
Add a description, image, and links to the deadlock-avoidance topic page so that developers can more easily learn about it.
To associate your repository with the deadlock-avoidance topic, visit your repo's landing page and select "manage topics."