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

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.

Pthreads and scychronization Topics

Crossfire blog code for posts, articles and examples

OS Experiments in Kotlin

🚀 Streamline parameter binding in ASP.NET Core Minimal APIs with JsonStreaming, automatically handling JSON arrays as IAsyncEnumerable sequences.

A concurrent job queue system built in Java w/ Spring Boot, retry logic, configurable worker pools, RESTful API endpoints. Designed as a learning project to explore idiomatic Java concurrency (ExecutorService) and the Producer–Consumer model. Inspired by real job queue systems such as Celery. This is a Java remake of my GoQueue project

A very basic lightweight, concurrent job queue system built in Go (Golang), featuring retry logic, customizable job types, RESTful API endpoints, and a simple React/TypeScript dashboard for monitoring and control. Meant to mimic the functionality of real-life Job Queue services e.g., Celery. At its core, it implements the Producer-Consumer Model.

This repository contains following examples:

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

Implementation of the producer-consumer problem written in C

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