deadlockprevention

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

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.

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.

Trabalho Discente Efetivo da disciplina de Performance em Sistemas Ciberfísicos - 4° Período

Multi-threaded simulation solving the Dining Philosophers problem via POSIX synchronization metrics

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

A C++ URL Shortener integrated with Operating System concepts including Process Scheduling, Memory Management, Deadlock Prevention, Multithreading, Analytics Dashboard, and Concurrent Request Simulation.

OS-Resource-Concurrency-Lab

Multi-process tactical RPG demonstrating shared memory IPC, multithreading, signals, and deadlock detection/prevention — built in C++17 for an Operating Systems course.

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

Traffic Concurrency Controller is an operating systems-inspired simulation tool that manages high-throughput request handling. It implements core OS concepts—including Priority Scheduling, Round Robin Scheduling, Concurrency Control, and a Deadlock Avoider—to ensure safe, efficient, and starvation-free resource allocation.

Deadlock Avoidance in Operating Systems in two method: 1)

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.

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

Dining Philosophers simulated in C: one pthread per philosopher, one mutex per fork, and a monitor thread that detects starvation within milliseconds. Deadlock-free through parity-based lock ordering, with no data races and no leaks. 42 School project, graded 100/100, norminette clean.

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.