Concurrent Solutions to the Dining Philosophers Problem using Threads (Mutexes) and Processes (Semaphores). Explore synchronized approaches to address the classic challenge of coordinating philosophers' dining interactions efficiently and prevent deadlocks.
solving the dining philosophers problem using threads and mutexes
A dynamic data race detector for CUDA programs
Implementation of the Dining Philosophers Problem
🤔 In this project, you will learn the basics of threading a process. You will see how to create threads and you will discover mutexes.
Runtime Detection of Data Races in OCaml with ThreadSanitizer
A server-client implementation where multiple threads are concurrently handling mock requests.
Serious game for learning about concurrency - thread interleavings, data races and deadlocks.
Coderrect is a static analyzer for concurrent C/C++/Fortran programs to detect data-races/race-conditions/anti-patterns.
Code samples demonstrating multi-threading concepts in C++
LLOV: LLVM OpenMP Verifier - : A Fast Static Data-Race Checker for OpenMP Programs
Web Locks API 🔒
Data race benchmark suite for evaluating OpenMP correctness tools aimed to detect data races.
Add a description, image, and links to the data-race topic page so that developers can more easily learn about it.
To associate your repository with the data-race topic, visit your repo's landing page and select "manage topics."