threads, mutexes, semaphores, shared memory, processes

A Classic Concurrency Problem illustrating the actions of Multithreads and Processes

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.

A multi-threaded program that demonstrates "bound-buffer" problem using POSIX threads semaphores and mutexes

Implementation of the thread deadlock protection algorithm.

basics of threading a process. create threads and mutexes.

Code for Go Concurrency Tools

Solve the dining philosophers problem with threads and mutexes

Test driven golang exercises.

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.

Process Mutex Vulnerability Assessment Tool

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

🍝 🍽️ The dining philosopher's problem: solution with mutexes

This project is a solution to the classic diner philosophers problem.

Implementation of the Dining Philosophers Problem

Multithreading simulation project where philosophers dine, think, and sleep while avoiding death by starvation. It's an exploration of process threading, mutexes, and the dining philosophers problem in C. This project provides practical experience with the challenges of synchronizing threads and processes to achieve a common goal

producer-consumer, bounded buffer, semaphores and mutexes