From e560f60fc35889fefba95389ea53c6d02a9e22e9 Mon Sep 17 00:00:00 2001 From: Jawwad Ahmad Date: Mon, 8 May 2017 01:09:02 +0500 Subject: [PATCH] Fix a few typos in DiningPhilosophers Readme an -> a dinining -> dining "no needs" -> "no need" --- DiningPhilosophers/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/DiningPhilosophers/README.md b/DiningPhilosophers/README.md index 0bf4f28ce..bc622e559 100755 --- a/DiningPhilosophers/README.md +++ b/DiningPhilosophers/README.md @@ -22,12 +22,12 @@ Eating is not limited by the remaining amounts of spaghetti or stomach space; an The problem is how to design a discipline of behavior (a concurrent algorithm) such that no philosopher will starve; i.e., each can forever continue to alternate between eating and thinking, assuming that no philosopher can know when others may want to eat or think. -This is an illustration of an dinining table: +This is an illustration of a dining table: ![Dining Philosophers table](https://upload.wikimedia.org/wikipedia/commons/7/7b/An_illustration_of_the_dining_philosophers_problem.png) # Solution -There are different solutions for this classic algorithm, and this Swift implementation is based on the Chandy/Misra solution. This implementation allows agents to contend for an arbitrary number of resources in a completely distributed scenario with no needs for a central authority to control the locking and serialization of resources. +There are different solutions for this classic algorithm, and this Swift implementation is based on the Chandy/Misra solution. This implementation allows agents to contend for an arbitrary number of resources in a completely distributed scenario with no need for a central authority to control the locking and serialization of resources. However, this solution violates the requirement that "the philosophers do not speak to each other" (due to the request messages).