Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02219502n
Noun Concept
SYL
No term available
EN
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. Wikipedia
Relations
Sources
IS A
EN
undertaking
AUTHOR
EN
Edsger W. Dijkstra
MAIN SUBJECT
EN
deadlock
NAMED AFTER
EN
philosopher

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License