Skip to content
#

dining-philosophers-problem

Star

Here are 164 public repositories matching this topic...

Language: All
Filter by language
All 164 C 80 Java 32 C++ 18 Python 12 C# 5 Go 3 Erlang 2 Jupyter Notebook 2 Shell 2 Batchfile 1
Sort: Most stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

AmanCSE-1 / Operating-System

Star 14

This repository contains the Python Programs for various algorithms of Operating Systems

operating-system dining-philosophers-problem cpu-scheduling-algorithms first-come-first-serve least-recently-used banker-algorithm first-in-first-out bankers-algorithm disk-scheduling-algorithms shortest-job-first page-replacement-algorithm first-come-first-served shortest-seek-time-first dynamic-partitioning-placement first-fit-algorithm best-fit-algorithm worst-fit-algorithm
  • Updated Oct 11, 2021
  • Python

clementvidon / philosophers

Star 14

[documented code / -pedantic -std=c89] - 42School variant of the dining philosophers problem to learn the basics of threading a process, how to create threads and use mutexes.

concurrency multithreading concurrent-programming cleancode mutex-synchronisation c89 42born2code 42 dining-philosophers 42school dining-philosophers-problem ansi-c dinning-phillospher philosophers-dinner-problem philosophers 42projects 42paris 42cursus philosophers42
  • Updated Oct 12, 2022
  • C

mcombeau / philosophers

Star 13

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.

concurrency processes concurrent-programming mutex threads mutex-synchronisation 42born2code 42 mutexes dining-philosophers-problem semaphores philosophers-dinner-problem philosophers 42projects 42cursus philosophers42
  • Updated Nov 15, 2022
  • C

Rakibul73 / Operating_System_Code

Star 13

Operating System Code in Python 3

python fcfs deadlock-detection dining-philosophers-problem sjf priority-scheduling mutex-lock deadlock-avoidance first-come-first-serve banker-algorithm bankers-algorithm shortest-job-first round-robin-scheduling producer-consumer-problem peterson-algorithm dining-philosophers-problem-semaphore-solution semaphore-dining-philosopher semaphore-producer-consumer semaphore-producer-consumer-semaphore-solution
  • Updated Aug 8, 2023
  • Jupyter Notebook

Dare-marvel / Operating-Systems--OS--

Star 3

💻 Welcome to the Operating Systems Repository! 📚✨ Immerse yourself in a meticulously curated knowledge reservoir on Operating Systems. 🌐💡 Explore the intricacies of system management, processes, and kernel architecture. 🚀🔍 Master the art of efficient operating system navigation in this dynamic space! 👨‍💻🌐

multithreading operating-system memory-management dining-philosophers-problem semaphores linux-commands dynamic-linking process-synchronization bankers-algorithm static-linking shortest-job-first binary-semaphore cscan-scheduling sstf-scheduling disc-sheduling-algorithms
  • Updated Dec 22, 2023
  • C

Improve this page

Add a description, image, and links to the dining-philosophers-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the dining-philosophers-problem topic, visit your repo's landing page and select "manage topics."

Learn more