`linear-locks` provides locking primitives that are statically guaranteed to be free of deadlocks.

Dining Philosophers reimagined. Concurrency simulation in C (42 project), multiple coders compete for shared USB dongles using pthreads, mutexes, condition variables, and a priority queue. Supports FIFO and EDF scheduling with burnout detection under 10 ms.

A small Ada project simulating a restaurant, solving concurrency challenges like deadlock prevention and buffer balancing in a Producer-Consumer model using selective rendezvous and asynchronous transfer of control.

Interactive OS Learning Platform for simulating deadlocks and it's avoidance

OS-Resource-Concurrency-Lab

Dining Philosophers Problem solution to explore multithreading, synchronization, and resource management in C using POSIX threads (pthreads)

A mini file system that delivers the power and functionality you expect from a real command-line shell.

A Python simulation of the Banker's Algorithm for deadlock avoidance in Operating Systems with visualizations for resource allocation, safe sequence, and resource progression using Matplotlib.

Implemented solutions for core OS concepts, including Multithreading, CPU Scheduling algorithms (e.g., FCFS, SJF, Round Robin), and Synchronization techniques. Addressed and provided solutions for common concurrency problems such as Deadlock and Starvation.