There are 0 repository under mutex-synchronisation topic.
Chronos - A static race detector for the go language
Safe concurrency in D (`shared` made easier)
Promised based Javascript Mutex
SparkDI is a dependency injection framework in Swift. It aims to provide a simple and efficient dependency injection solution for Swift projects, with support for scopes and flexible dependency resolution.
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.
A C++11 shared mutex with high emphasis on performance
[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.
The dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them.
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.
Mitra: Shared memory synchronization manager
Multithreaded TCP Client/Server implementation in C++
A memory-efficient, in-memory, flexible, Promise-based locking library without dependencies.
CLI for audio player to stream and play all your music files at ease and fast on your terminal
A simple thread pool written in C++17.
These exercises were attempted and completed during the course 'Operating Systems' offered by Dr. Sivaselvan B. at IIITDM Kancheepuram.
Interactive tutorials to learn os concepts
Synchronization Library and Static Analysis Tool for C# 8
Locking-Center provides very useful primitive service in many environments where different processes must operate with shared resources in a mutually exclusive way.
Walking philosophers
Explore concurrent programming with this classic implementation of the dining philosophers problem. Philosophers navigate a dining table, juggling between thinking and eating, showcasing synchronization challenges and resource allocation in a shared environment.
Implementation of the Dining Philosophers problem in C
✅ System Programming Labs, BSUIR 2019
Algorithm devised by Boleslaw Szymanski. This MutEx has linear wait and only 5 communication variables
Unix OS, Process Creation, System Calls, Process Communication using Pipes and Signals, Shared Memory, Process Synchronization using POSIX Semaphores, Unix File System Manipulation,
BT detector simulator in C using pThreads
Simple CLI Operating System
A 42 school project that simulates the Dining Philosophers problem using multithreading (philo) and multiprocessing with semaphores (philo_bonus). The goal is to handle concurrency, synchronization, and avoid deadlocks and starvation.
In this project, you will learn the basics of threading a process. You will see how to create threads and you will discover mutexes.
Sample examples of multi-threaded code in Java.
These projects are course assignment projects done for Advanced Operating System, done mainly in c and java
This project is a restaurant management simulation created using Java and Swing. It simulates the roles of restaurant staff (customers, waiters, chefs, and cashiers) using multi-threading techniques.
Multi-process, multi-threaded supermarket simulation with dynamic cashier management, customer flow control, and emergency evacuation handling. Uses semaphores, mutexes, message queues, and shared memory for synchronization and inter-process communication.