Advisory locking for ActiveRecord

Concurrency in Go video course with in depth explanations & examples

Header only read/write wrapper to combine mutexes with locks.

🍺 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 prog…

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.

A lightweight profiler to detect and categorize root causes of synchronization related performance issues in multithreaded programs

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

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.

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

[ARCHIVE/2014] OS-independent utils for C++

Controlled borrowing of mutable values for safe concurrency

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).

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.

Three tasks that teach how to work with mutexes, semaphores and forks.

Barbershop Problem - A Classical Synchronization problem - Operating Systems (OS) Complex Engineering Project of 6th Semester