Dining philosophers problem  

From The Art and Popular Culture Encyclopedia

Revision as of 11:03, 1 November 2011; view current revision
←Older revision | Newer revision→
Jump to: navigation, search

Related e



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 also

Unless indicated otherwise, the text in this article is either based on Wikipedia article "Dining philosophers problem" or another language Wikipedia page thereof used under the terms of the GNU Free Documentation License; or on research by Jahsonic and friends. See Art and Popular Culture's copyright notice.

Personal tools