Process synchronization, Deadlock avoidance and Disk scheduling algorithms implemented in Java.

To whom it may concern

Java concurrency exercises

A school project to deal with the dining philosophers problem.

Java Path Finder and Gradle configuration with simple dining philosopher problem

A distributed solution for the classic Dining Philosophers problem

Multi-threaded simulation of the Dining Philosophers Problem extended to multiple tables. Detects and handles deadlocks as philosophers move between tables. Written in Java.

Examble about Deadlock ( OS Course )

Drinking Philosopher

Implementation of Concurrency Programming problem, Dining Philosophers.

A solution to the famous concurrency problem, Dining Philosophers.

This project is a tool to help better understand classic problems of synchronization in multi-threading using synchronization primitives.

Operating system programming concepts, Operating Systems with System Programming (IDATA2305) course, spring 2022.

Implenting Dinning Philosophers problem in a client-server style with nice GUI using java and javafx

Data structures, algorithms, etc. Solutions to some common interview questions.

A dining philosophers implementation done in java, making use of Semaphores

Implementation of Dining Philosophers Solution in Java

A classic example problem often used in concurrent algorithm design.

Explores classic concurrency problems using Java.