threads, mutexes, semaphores, shared memory, processes

Barbershop Problem - A Classical Synchronization problem - Operating Systems (OS) Complex Engineering Project of 6th Semester

A Classic Concurrency Problem illustrating the actions of Multithreads and Processes

The project simulates philosophers sharing a bowl of spaghetti, alternating between thinking and eating. The goal is to manage resource sharing to avoid deadlock and allow all philosophers to eat. It teaches concepts of synchronization and concurrency.

bombard-b2

Eat, Sleep, Spaghetti, repeat. This project is about learning how threads work by precisely timing a group of philosophers on when to pick up forks and eat Spaghetti without dying from hunger.

3 different problems solved with multithreading. University project [no.2] for Concurrent Programming (Fall 2017).

Implementation of a multi-threaded poller server. Client-Server communication through TCP. Thread synchronization with mutexes and condition variables

A simulation of the classic Dining Philosophers problem using threads and multithreading.

[CMPT 300: Operating Systems I] A multi-threaded program that demonstrates "bound-buffer" problem using POSIX threads semaphores and mutexes

Implementation of the thread deadlock protection algorithm.

Program involving multi-threading and multi-process programming, employing mutexes and semaphores

basics of threading a process. create threads and mutexes.

Code for Go Concurrency Tools

Solve the dining philosophers problem with threads and mutexes

Process Mutex Vulnerability Assessment Tool

Dining philosophers problem solved, synchronization issues...

A simulation project dealing with threads, mutexes and synchronization - from the famous dining philosopher's problem.

a 42 school curriculum project exploring concurrency with threads & mutexes or processes & semaphores. It is based on Dijkstra's famous dining philosophers problem