Difference between revisions of "Dining Philosopher"

From Sharewiki.org
Jump to: navigation, search
(Created page with 'A Philosopher is a "lover of wisdom". Every Person / Player / Actor / Peer / User must share. ''In computer science, the dining philosophers problem is …')
 
m
 
Line 8: Line 8:
  
 
''This is a theoretical explanation of deadlock and resource starvation by assuming that each philosopher takes a different fork as a first priority and then looks for another.'' -- http://Wikipedia.org/wiki/Dining_philosophers_problem
 
''This is a theoretical explanation of deadlock and resource starvation by assuming that each philosopher takes a different fork as a first priority and then looks for another.'' -- http://Wikipedia.org/wiki/Dining_philosophers_problem
 +
 +
[[Category:Links]]

Latest revision as of 20:42, 7 January 2011

A Philosopher is a "lover of wisdom".

Every Person / Player / Actor / Peer / User must share.

In computer science, the dining philosophers problem is an illustrative example of a common computing problem in concurrency. It is a classic multi-process synchronization problem.

In 1965, Edsger Dijkstra set an examination question on a synchronization problem where five computers competed for access to five shared tape drive peripherals. Soon afterwards the problem was retold by Tony Hoare as the dining philosophers problem.

This is a theoretical explanation of deadlock and resource starvation by assuming that each philosopher takes a different fork as a first priority and then looks for another. -- http://Wikipedia.org/wiki/Dining_philosophers_problem