A thread-safe generic first in-first out (FIFO) collection with support for priority queuing.

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

Pthreads and scychronization Topics

Crossfire blog code for posts, articles and examples

Implementacion en java con semaforos al problema productor/consumidor y lector/escritor.

This repository contains following examples:

Implementation of the producer-consumer problem written in C

An implementation of the producer-consumer problem which is visually aided with dashboard to view the current commodities being produced and consumed, the program is implemented using shared memory, semaphores and mutexes in C.

This is a simulation of the model Producer-ProducerConsumer-Consumer.