dining-philosophers-akka

This is an attempt to solve the Dining Philosophers Problem with Akka

Dining Philosophers Problem

Dining philosophers problem was initially introduced by Edsger Dijkstra, as an excercise to illustrate synchronization issues and techniques for resolving them.

Problem Statement

N philosophers are sitting at a table with N chopsticks, each needs two chopsticks to eat, and each philosopher alternates between thinking and eating.

Picture and problem statement taken from Alison Norman's slides for Principles of Computer Systems class

Solution

Multiple solutions to this problem exist. This is an implementation of an arbitrator solution, where the waiter controlls all the chopsticks and gives them out to philosophers when they ask.

##Akka Akka is a toolkit for concurrent, resilient and distributed applications that emphasizes actor-based concurrency