threads, mutexes, semaphores, shared memory, processes
-
Updated
Feb 27, 2021 - C
threads, mutexes, semaphores, shared memory, processes
A Classic Concurrency Problem illustrating the actions of Multithreads and Processes
42 Project - involves developing a solution in C to the famous dining philosophers problem in concurrent programming. The challenge lies in preventing deadlock and data race ensuring that each philosophers can access necessary forks without encountering confilcts
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.
A multi-threaded program that demonstrates "bound-buffer" problem using POSIX threads semaphores and mutexes
Concurrent Programming in C (3rd year - 5th semester)
🧐 Project for Codam that utilizes multi-threading and mutexes to simulate a table of philosophers eating, sleeping and thinking
OS PRACTICAL IMPLEMENTATION
Solving synchronization issues with mutexes and semaphores
WSU student code for the dining philosopher problem with mutexes
Program involving multi-threading and multi-process programming, employing mutexes and semaphores
Add a description, image, and links to the mutexes topic page so that developers can more easily learn about it.
To associate your repository with the mutexes topic, visit your repo's landing page and select "manage topics."