The Dining Philosophers problem demonstrates tbb::flow and the use of the reserving join node to
solve the potential deadlock.
This program runs some number of philosophers in parallel, each thinking and then waiting for chopsticks
to be available before eating. Eating and thinking are implemented with sleep(). The chopstick positions are represented by a queue_node with one item.
For the most up to date system requirements, see the release notes.
For information about the minimum supported version of IDE, see release notes.
General build directions can be found here.
Intel and the Intel logo are trademarks of Intel Corporation in the U.S. and/or other countries.
* Other names and brands may be claimed as the property of others.
© 2020, Intel Corporation