Short self-contained descriptions of distributed algorithms suitable for 2nd year undergraduates.

Miscellaneous JAVA tests and trials, including lifedays, decathlon calculations, dining philosophers simulation and other interview questions

Classical problems of synchronization using Semaphores and Condition Variables in java

This C++ code implements a simulation of the dining philosophers problem using threads and synchronization mechanisms.

A concurrent programming project that simulates the Dining Philosophers Problem. It explores process synchronization using threads, mutexes, processes, and semaphores to prevent deadlocks and manage resource sharing efficiently.

This project implements the classic Dining Philosophers Problem using Pthreads and semaphores in C++.

Ce projet simule le problème classique des philosophes et du repas, où plusieurs philosophes doivent partager des ressources (fourchettes) pour manger et réfléchir, tout en évitant les situations de deadlock et de starvation.

"Dive into the world of concurrency with Philosophers, a project that explores the dining philosophers problem."

📚 Centralized collection of syllabus, books, experiments, and practice questions for the Operating Systems course at Urmia University.

This repository contains all the source code that I have written for my Operating System course.

This project introduces the basics of threading in process management, demonstrating how to create threads and utilize mutexes to handle concurrent operations safely.

Python project implementing simulation of Dining philosophers problem

Various small programs: barnsley fern, game of life, christmas tree, langton's ant, bean machine, etc.

42 School Philosophers project: The Dining Philosophers Problem, written in C.

Dining philosophers using systemd and the Unix Programming Environment

Various flavored solutions to the Dining Philosophers problem.

Multithreading simulation project where philosophers dine, think, and sleep while avoiding death by starvation. It's an exploration of process threading, mutexes, and the dining philosophers problem in C. This project provides practical experience with the challenges of synchronizing threads and processes to achieve a common goal

Solve the dining philosophers problem with threads and mutexes

"This repository showcases the implementation of semaphores, a synchronization tool."

A solution to the famous Dining Philosophers problem using the Token Ring approach.