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.

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

The dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them.

Walking philosophers

Interactive tutorials to learn os concepts

These exercises were attempted and completed during the course 'Operating Systems' offered by Dr. Sivaselvan B. at IIITDM Kancheepuram.

BT detector simulator in C using pThreads

Explore concurrent programming with this classic implementation of the dining philosophers problem. Philosophers navigate a dining table, juggling between thinking and eating, showcasing synchronization challenges and resource allocation in a shared environment.

Unix OS, Process Creation, System Calls, Process Communication using Pipes and Signals, Shared Memory, Process Synchronization using POSIX Semaphores, Unix File System Manipulation,

In this project, you will learn the basics of threading a process. You will see how to create threads and you will discover mutexes.

Implementation of the Dining Philosophers problem in C

A 42 school project that simulates the Dining Philosophers problem using multithreading (philo) and multiprocessing with semaphores (philo_bonus). The goal is to handle concurrency, synchronization, and avoid deadlocks and starvation.

These projects are course assignment projects done for Advanced Operating System, done mainly in c and java

Multi-process, multi-threaded supermarket simulation with dynamic cashier management, customer flow control, and emergency evacuation handling. Uses semaphores, mutexes, message queues, and shared memory for synchronization and inter-process communication.

This is modified version of famous consumer-producer problem with N readers and 1 writer threads with a fix sized buffer.

Low-level Linux primitives

[Note : 14 / 20] Projet UE Programmation système avancée (Université Paris Cité, M1) : Implémentation de files de messages pour une communication entre des processus tournant sur la même machine, en utilisant la mémoire partagée, et sans l’aide de files de messages existantes ou des sockets. L’accès parallèle à la file de messages est possible a…

Operating Systems - Formula 1 simulator. Used several OS concepts like multi-threading, synchronization, file system, ...

The basics of multithreading with pthreads. [UFMG-FSPD-TP1]

Bus station simulation using shared memory and POSIX semaphores