First readers writers solution using semaphore and mutex in c
-
Updated
Dec 10, 2019 - C
First readers writers solution using semaphore and mutex in c
A simple synchronization algorithm avoiding sending of redundant data.
Operating System Lab Course (CS 314), IIT Dharwad
C code samples with commentary
This project is a high-performance, thread-safe implementation of the classic Dining Philosophers synchronization problem using POSIX threads in C
Synchronization and communication between threads (through strongly typed message queues) made easy with channels. Really.
Add a description, image, and links to the synchronisation topic page so that developers can more easily learn about it.
To associate your repository with the synchronisation topic, visit your repo's landing page and select "manage topics."