Synchronization of processes using semaphores
-
Updated
Oct 3, 2021 - C
Synchronization of processes using semaphores
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
a multithreaded proxy web server with LRU cache is being implemented in CPP programming language. strong understanding of OS related concepts is being used here.
Refer Readme.md
One producer and n consumers problem (m data elements and shared memory)
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".
Assignment files used for OS Lab UE18CS305
Add a description, image, and links to the semaphores-locking topic page so that developers can more easily learn about it.
To associate your repository with the semaphores-locking topic, visit your repo's landing page and select "manage topics."