Dining Philosopher Problem - in the easy way. We have five philosopher sitting around a table and they are either thinking or eating. There is rice on the table, but there are only five chopsticks - and one need two of them for eating. In this easy treatment ANY two of the five chpsticks can be used for eating - if we can acquire them. The five chopsticks are represented by a 5-slots semaphore (a semaphore counting from 0 to 5). The philosophers are represented as threads.
Diff: mbed.bld
- Revision:
- 0:abf1becf9617
diff -r 000000000000 -r abf1becf9617 mbed.bld --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/mbed.bld Wed Feb 10 12:46:34 2016 +0000 @@ -0,0 +1,1 @@ +http://mbed.org/users/mbed_official/code/mbed/builds/f141b2784e32 \ No newline at end of file