English Wikipedia - The Free Encycl...
Download this dictionary
Dining philosophers problem
In
computer science
, the
dining philosophers problem
is an example problem often used in
concurrent
algorithm design to illustrate
synchronization
issues and techniques for resolving them.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License