Producer and Consumer are part of an application. The producer access a two dim matrix of int (of 100 x 100) and produces the memory address as an item and store it in a array of pointers to int. The consumers compete and get an entry of the array that corresponds to a row, and finds the number of primes in that row and adds it to a shared sum

Philosopher tutorial

One producer and n consumers problem (m data elements and shared memory)

Assignment files used for OS Lab UE18CS305

Synchronization of processes using semaphores

MTJS (Multiple Threading Join Semaphore) - Basic implementation of multiple threading with prerequisite that depends on another thread(s) that could be categorized as 'Semaphore implementation'.

Simulação de um ecossistema aquático contendo Tubarões, Peixes, Focas e Algas implementado usando Threads em Python e Pygame

Projects for Better understanding C Language and systems features

Refer Readme.md

Implementation of Concurrency Programming problem, Dining Philosophers.

Solves a synchronization problem using multi-threading

🔐A C++ example demonstrating the OS concepts of Process Forking, Shared Memory, Semaphores by solving an interesting problem

This is a university project made by Giacomo Perlo and Alessio Mana in Turin in January 2021 for our Operating Systems Exam. We named it "TaxiCab Game".