There are 0 repository under mutexes topic.
Advisory locking for ActiveRecord
Concurrency in Go video course with in depth explanations & examples
Header only read and write locks for mutexes.
:beer: In-depth internals, my personal notes, example codes and projects. Includes - Thousands of codes, OOP, Concurrency, Parallelism, Goroutines, Mutexes & Wait Groups, Testing in Go, Go tool chain, Backend web development, Some projects including Log file parser using bufio.Scanner, Spam Masker, Retro led clock, Console animations, Dictionary programs, Social Network built using Go and GopherJS, Database Connectivity and working (MySQL, MongoDB, Redis), GopherJS and lot more..
Dining philosophers problem's guide for 42 school
Philosophers is a comprehensive guide and solution to the classic Dining Philosophers Problem in computer science. This project uses the C programming language and multithreading to implement a solution that prevents deadlocks and resource conflicts.
Muteces (mutexes/mutants) used by various malware families
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 simple POSIX threading library for MATLAB Coder
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.
This project serves as an introduction to multithreading. The purpose was to build two different programs to solve the famous dining philosophers problem, each with different constraints.
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.
Algorithm devised by Boleslaw Szymanski. This MutEx has linear wait and only 5 communication variables
A simple multi user client/server chat application written in Go using less than 250 loc. Useful to learn how to deal with concurrency in Go (goroutines, channels, and mutexes).
Three tasks that teach how to work with mutexes, semaphores and forks.
In this project, I tackled the Philosopher's Problem. By coding the solution to this problem, I aimed to grasp the functioning and usage logic of threads in the C language, as well as learn how to effectively utilize mutexes.
dining philosophers problem
Dining philosophers problem solved, synchronization issues...
Two solutions to the problem of dining philosophers. The project was done in September 2021.
TCP Server/Client in C++ using sockets, mutexes, conditional variables and multi-threading.
A Traffic Simulation Project submission that was part of the Udacity C++ Nano degree curriculum
the dining philosophers problem, with the use of semaphores and threads .
Barbershop Problem - A Classical Synchronization problem - Operating Systems (OS) Complex Engineering Project of 6th Semester
Philosophers dinner problem using threads
Philosophers tackles the "Dining Philosophers" problem, focusing on concurrency issues such as deadlock and starvation. It simulates philosophers as threads/processes using mutexes/semaphores for fork management. The program logs state changes and detects starvation, ending when a philosopher dies or all have eaten a specified number of times.
Program involving multi-threading and multi-process programming, employing mutexes and semaphores
In this project, I applied the most commonly used CPU Scheduling algorithms in C++ and explained the processes/threads, scheduling process, and synchronization.
3 different problems solved with multithreading. University project [no.2] for Concurrent Programming (Fall 2017).
🧐 Project for Codam that utilizes multi-threading and mutexes to simulate a table of philosophers eating, sleeping and thinking