In this project, you will learn the basics of threading a process. You will learn how to make threads. You will discover the mutex

Refer Readme.md

CSCI P536 - XINU

Similar to BarberShop problem

🧠 A project that addresses the synchronization of multi threads and multi processes and addresses the paradigm of the philosophers' dinners

Multi-threaded web server

Problems on Concurrency

This repository consists of the course project for ECEN 5623 Real-Time Embedded Systems

A process synchronization problem.

Implementation of a multithreaded server that allows multiple users to make requests at the same time. Built for the course Operating Systems @CS.UOI.

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.

The Dining Philosopher Problem states that N philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him. One chopstick may be picked up by any one of its adjacent followers but not both.

Project aims to show basics of multithreading programming

Synchronization primitive: condition variable from a mutex

This 42 C project is about the basics of threading a process and using mutex.

Dinning savages algorithm example using threads MUTEX