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.
File List
main.cpp [code] |
Generated on Wed Jul 20 2022 14:39:28 by 1.7.2