Chronos - A static race detector for the go language
Safe concurrency in D (`shared` made easier)
Promised based Javascript Mutex
A C 11 shared mutex with high emphasis on performance
Philosophers is a project from the 42 school curriculum that explores concurrent programming with threads and mutexes, processes and semaphores. It is a variation on the famous dining philosophers problem.
[documented code / -pedantic -std=c89] - 42School variant of the dining philosophers problem to learn the basics of threading a process, how to create threads and use mutexes.
Add table-level database locking to ActiveRecord
This is a project for the practical work of the Operating system module in The University of Ibn Khaldoun - Algeria in which we had used the notion of threads and parallelism to make a library simulator.
Multithreaded TCP Client/Server implementation in C
Mitra: Shared memory synchronization manager
A memory-efficient, in-memory, flexible, Promise-based locking library without dependencies.
A Go Library to Efficiently Store a Set of Mutex or RWMutex
Cross-Window Broadcasting and Locking
A simple thread pool written in C 17.
CLI for audio player to stream and play all your music files at ease and fast on your terminal
Synchronization Library and Static Analysis Tool for C# 8
Walking philosophers
Locking-Center provides very useful primitive service in many environments where different processes must operate with shared resources in a mutually exclusive way.
Often referred to as the Dining Philosophers Problem, is a classical synchronization problem that explores the challenges of resource sharing and deadlock avoidance.
Add a description, image, and links to the mutex-synchronisation topic page so that developers can more easily learn about it.
To associate your repository with the mutex-synchronisation topic, visit your repo's landing page and select "manage topics."