Skip to content

Commit d5fc1fd

Browse files
authored
Merge pull request #459 from jawwad/patch-3
Fix a few typos in DiningPhilosophers Readme
2 parents f5e060f + e560f60 commit d5fc1fd

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

DiningPhilosophers/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -22,12 +22,12 @@ Eating is not limited by the remaining amounts of spaghetti or stomach space; an
2222

2323
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.
2424

25-
This is an illustration of an dinining table:
25+
This is an illustration of a dining table:
2626

2727
![Dining Philosophers table](https://upload.wikimedia.org/wikipedia/commons/7/7b/An_illustration_of_the_dining_philosophers_problem.png)
2828

2929
# Solution
30-
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.
30+
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.
3131

3232
However, this solution violates the requirement that "the philosophers do not speak to each other" (due to the request messages).
3333

0 commit comments

Comments
 (0)