Producer-consumer problem solution using semaphore and mutex

🔄 A thread switching package which targets at Edsim51 simulator.

Programming with C course: pointer, multi-process, multi-thread, concurrency, semaphores, Socket, PIPE, FIFO

Producer & Consumer simulation to experiment and learn threading.

Producer - Consumer simulation using unix mutex synchronisation on cyclic array

Producer-Consumer problem using semaphores

Implementation of the producer-consumer problem written in C

Utilized producer-consumer solution to manage access to a bounded buffer storing data items

Systems Programming (C Language) File I/O, Multi Process, Parallel Programming, Synchronization, Signal Handling, Pipes, Threads, POSIX Threads, System-V Threads, Thread Pool, Dynamic Pool, Semaphores, Multiple Produceser Multiple Consumer Problem, Prioritizing, Sockets, Daemon Process, Server Client

A comparison by parallel processing methods in different languages of a simple DNS resolver in a consumer/producer model.

This is an implementation in C of the Warehouse Problem. Good problem to practice multi-process synchronization

My operating system codes for summer semester 2017.

This C program impends the producer-consumer problem and copies the contents of file1 to file2 through a shared memory buffer.

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

Producer Consumer Problem

The program simulates a donut shop. The donut shop will have 2 bakers. For each baker, the number of donuts the baker will bake today and the time it takes to bake one donut will be inputted. The baker will randomly bake 4 different types of donuts. When the baker chooses what kind of donut to make he looks at the bin where the donut will go, if…

Speed up your NodeJS app with N-API and Linux epoll

Operating System Practice course projects.

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