Various flavored solutions to the Dining Philosophers problem.

My Presentation For OS class | Topic: Simulation for Dining Philosophers

Exercise to manage thread in C++

Implementation of a solution for the "Dining Philosophers" problem in C | Implementação de uma solução ao problema "Jantar dos Filósofos" em C

Project for university. Dining philosophers problem in C++.

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

Implementation of the three execution models used in concurrent programming

Basic process synchronisation using semaphores in linux demonstrated by special kind of Dining Philosophers problem

Exercice multi threading / programmation systèmes temps réél

Dining Philosophers using Chandi-Misra algorithm

My attempt at resolving Dining Philosophers Problem done for Operating Systems (Systemy Operacyjne 2) course at the university.

This repo provides the basic implementation of the Dining-Philosophers problem. Check out the README for the problem statement.

A solution to the dining philosophers problem using C++ with std::thread and graphical interface implemented in ncurses.

An implementation of a solution to the dining philosophers problem.

This is a college project of Operating Systems completed by me. It contains CPU scheduling, Semaphore(Dining Philosopher Problem), Deadlock(Bankers Algorithm), Memory Management(Two-Level Page-Table Scheme ,Hashed Page Table with TLB),Page Replacement (Second Chance Algorithm using circular link list). Also a simple GUI menu is also implemented.

Dining Philosophers Problem C++ implementation.