this project's goal is to solve the dining philosopher's problem with a multi threaded approach

Philosophers implements the classic Dining Philosophers problem of 42 cursus using threads and mutexes in C. The project explores concurrency, synchronization, and avoiding deadlocks or starvation in a multithreaded environment

A high-performance, multi-threaded transaction processing system built in C++ that demonstrates enterprise-level concurrent programming, design patterns, and real-time payment processing architecture.

Multi-threaded TCP client-server implementation in C++

Philosophers 42 Common Core project

This project simulates a parking lot where cars attempt to park using different synchronization strategies (Semaphore or Mutex).

extra simple bet api using golang , implemented to show how mutex and locks in golang can be used to access controll resources

SparkDI is a dependency injection framework in Swift. It aims to provide a simple and efficient dependency injection solution for Swift projects, with support for scopes and flexible dependency resolution.

🧠 A concurrency project simulating the classic Dining Philosophers problem using threads, mutexes, processes, and semaphores.

Often referred to as the Dining Philosophers Problem, is a classical synchronization problem that explores the challenges of resource sharing and deadlock avoidance.

This repo will be a place to update my progress on my golang "training-arch"

C/C++ Projects

Airline control system is basically an operating system that will allow to synchronize and schedule your flights according to the priority and in given schedule time, there are different flights that are set for being example. Just a basic project done for understanding of mutexes and locks.

A 42 school project that simulates the Dining Philosophers problem using multithreading (philo) and multiprocessing with semaphores (philo_bonus). The goal is to handle concurrency, synchronization, and avoid deadlocks and starvation.

🧠 A project that addresses the synchronization of multi threads and multi processes and addresses the paradigm of the philosophers' dinners

A solution to the dining philosopher problem. Introduction to parallel programming

datastore implements a simple key value storage, demonstrates generics, thread safe storage, and repository pattern for multiple storage backends

Simulação do problema dos filósofos usando threads e mutexes em C.