https://github.com/samyam81/classicipc

ClassicIPC is a repository showcasing implementations of classic concurrency problems solved using various synchronization mechanisms in different programming languages.
https://github.com/samyam81/classicipc

cpp csharp java kotlin thread

Last synced: about 1 year ago
JSON representation

ClassicIPC is a repository showcasing implementations of classic concurrency problems solved using various synchronization mechanisms in different programming languages.

• Host: GitHub
• URL: https://github.com/samyam81/classicipc
• Owner: samyam81
• Created: 2024-04-07T07:09:33.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2024-05-20T08:55:21.000Z (almost 2 years ago)
• Last Synced: 2025-01-27T09:14:27.920Z (about 1 year ago)
• Topics: cpp, csharp, java, kotlin, thread
• Language: Java
• Homepage:
• Size: 17.6 KB
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
**ClassicIPC**

This repository contains various implementations of classic concurrency problems solved using different synchronization mechanisms in different programming languages.

### Problem Descriptions:

1. **Dining Philosophers Problem:**

    - Implemented in C#, Java, Kotlin, and C++.

    - The problem involves a group of philosophers sitting around a dining table with a bowl of spaghetti in the center and a chopstick between each pair of adjacent philosophers. 

    - Philosophers alternate between thinking and eating but can only eat if they can acquire both chopsticks.

2. **Peterson's Solution:**

    - Implemented in Java.

    - Peterson's solution is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication.

3. **Producer-Consumer Problem:**

    - Implemented in C#, Java, Kotlin, and C++.

    - Involves two types of processes, producers and consumers, who share a common, fixed-size buffer used as a queue. 

    - Producers place items into the buffer, and consumers remove them. The problem is to make sure that the producer doesn't try to add items into the buffer if it's full and that the consumer doesn't try to remove items from an empty buffer.

4. **Semaphore Implementation:**

    - Implemented in C#, Java, and C++.

    - Semaphores are a classic synchronization primitive used to control access to a common resource by multiple processes in a concurrent system. They allow controlling access to shared resources through a counter mechanism.

### Usage:

- Each implementation can be compiled and executed using the respective programming language's compiler or interpreter.

- Detailed usage instructions are provided within each code file as comments or through method documentation.