Jisho

×
食事する哲学者の問題
Links
Wikipedia definition
1. 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. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, in terms of computers competing for access to tape drive peripherals. Soon after, Tony Hoare gave the problem its present formulation.
Read “Dining philosophers problem” on English Wikipedia
Read “食事する哲学者の問題” on Japanese Wikipedia
Read “Dining philosophers problem” on DBpedia

Discussions

to talk about this word.