
	Where results make sense

Topic: Dining philosophers

Related Topics

Dining philosophers problem

Trolley problem

Swamp man

Chinese room

Coherence (philosophical gambling strategy)

Infinite monkey theorem

Doomsday argument

Concurrency

Ship of Theseus

Hilary Putnam

Original position

Thought experiment

Simulated reality

Citigroup

Mysticism

In the News (Tue 22 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Dining Philosophers (Site not responding. Last check: 2007-10-20)
		In the centre of the table is a large plate of spaghetti.
		One fork is placed between each pair of philosophers and they agree that each will only use the fork to his immediate right and left.
		Philosophers are depicted in yellow when they are thinking, blue when hungry and green when eating.
	www-dse.doc.ic.ac.uk /concurrency/book_applets/Diners.html (108 words)

	Learn more about Dining philosophers problem in the online encyclopedia. (Site not responding. Last check: 2007-10-20)
		Five philosophers are sitting around a circular table and each has a plate of spaghetti in front of him with a fork either side (i.e.
		Suppose that the life of a philosopher consists of periods of eating and thinking, that each philosopher needs two forks to eat, and that forks are picked up one at a time.
		The philosopher a waits for the fork grabbed by philosopher b who is waiting for the fork of philosopher c and so forth, making a circular chain of deadlock.
	www.onlineencyclopedia.org /d/di/dining_philosophers_problem.html (579 words)

	www.technologyforall.com - Dining Philosophers
		Dining philosophers are five clients sitting around a circular table and there is a big bowl of spaghetti at the center of the table.
		This is due to the existence of an adversary scheduler that can continually prevent the philosophers in their attempts to reach agreement on who is to eat next, thereby leading to deadlock, that is, a situation where all five philosophers starve to death.
		Philosophers can always wait to see if both the forks are available before grabbing one, and soon after eating release the fork for the next hungry philosopher to eat next.
	www.technologyforall.com /TechForAll/Dining.html (1558 words)

	The Dining Philosophers
		Five philosophers who spend their lives thinking and eating.
		A philosopher may only pick one fork at a time.
		Think of each philosopher as a process and the forks are resources.
	www.cs.jhu.edu /~yairamir/cs418/os3/sld028.htm (31 words)

	Dining Philosophers Problem
		The dining philosophers problem is an example of this.
		Each philosopher has access to the forks at her left and right.
		Since the philosophers are sharing forks, it is not possible for all of them to be eating at the same time.
	laser.cs.umass.edu /verification-examples/dp_standard/dp.html (221 words)

	Deadlock and the Dining Philosophers
		Because each philosopher immediately has one chopstick and they're waiting on a condition that cannot be satisfied--they are all waiting for the left chopstick, which is held by the philosopher to their left.
		In the dining philosopher applet, there is no ordering imposed on the condition variables because the philosophers and the chopsticks are arranged in a circle.
		The philosopher who is sitting between chopsticks 1 and 2 and the philosopher who is sitting between chopsticks 1 and 5 must now reach for the same chopstick first (chopstick 1) rather than picking up the one on the right.
	www.science.uva.nl /ict/ossdocs/java/tutorial/java/threads/deadlock.html (543 words)

	[No title]
		The dining philosophers problem is an interesting example, because there is a trade off between optimization of parallelism and elimination of starvation.
		The dining philosophers problem is discussed in many textbooks as a classical problem illustrating the concepts of critical regions and synchronization [9,11,12,13].
		The monitor implementation does not affect the dining philosophers problem very much since it is rare that the waiting and entry queues simultaneously are not empty, and when they are, the order in which they are emptied has no affect.
	vip.cs.utsa.edu /nsf/pubs/starving/starving.html (3344 words)

	Dining philosophers problem (Site not responding. Last check: 2007-10-20)
		In computer science, the dining philosophers problem is an illustrative example of a common computing problem in concurrency.
		The status of the philosophers is kept using a shared data structure (e.g an array).
		After the philosopher is done eating, he again obtains a mutex lock, changes his state to thinking and sees, one at a time, if either of his two neighbors are hungry.
	www.casimiro.com /wiki/en/wikipedia/d/di/dining_philosophers_problem.html (513 words)

	Satan Comes to Dinner in E
		The Dining Philosophers Problem (aka The Dining Quintuple Problem) was designed in 1965 by Edsger W. Dijkstra to demonstrate the horror that is deadlock.
		Philosophers do not have the capabilities necessary to interact directly with the other philosophers, the plates of shrimp, or with the system in general.
		If the philosophers are run in a machine which is not under Satan's control, then the answer is no. E's containment mechanism assures that the philosophers cannot communicate directly with each other.
	www.erights.org /e/satan (3346 words)

	The Dining Philosophers problem (Site not responding. Last check: 2007-10-20)
		The dining philosophers problem concerns a number of philosophers who are in one of two states: eating or thinking.
		Now, in order for a philosopher to eat, he must have two chopsticks, i.e the chopstick on his left and the one on his right.
		The dining philosophers is a typical concurrency problem involving entities which need multiple resources - in this case it happens to be chopsticks.
	www.cs.uct.ac.za /Research/DNA/DaNAMiCS/manual/node66.html (121 words)

	epowiki: Dining Philosophers
		Between each pair of philosophers is a chopstick laid out on the table such that the first philosopher's right chopstick is the left chopstick of the second philosopher, whose right chopstick is the left chopstick of the third philosopher and so forth.
		The chef sees the philosopher's predicament, scorns the philosophers for letting his fine meal of noodles go cold and agrees with the philosophers that he'll dictate who should eat and when to prevent any confusion.
		As a philosopher nears starvation his hunger index rises above the "acquire while holding" value of one or both of his neighbors; at that point they must relinquish the use of their chopsticks and allow the starving philosopher to eat.
	www.possibility.com /epowiki/Wiki.jsp?page=DiningPhilosophers (899 words)

	CSCI 6500 PA4
		The main problem is that without some kind of coordination the philosophers could starve when they pick up their left forks and then block forever trying to pick up the right forks which are being held by other philosophers.
		When a philosopher wants to enter the dining lounge and there are less than n-1 philosophers in the room, the philosopher is let in and may sit in the table.
		When a philosopher wants to enter the dining lounge and there are already n-1 philosophers in the room, the bouncer chooses a thinking lounge at random for the philosopher to go to.
	www.cs.rpi.edu /academics/courses/spring06/distr/pa4.html (729 words)

	Lab 9: Dining Philosophers
		Every philosopher is waiting for his right chopstick, which has already been acquired by his right neighbor, and subsequently all philosophers will starve.
		Suppose two non-neighboring philosophers are fast thinkers and fast eaters, and they both acquire their left and right chopsticks and eat.
		The competition between philosophers for the chopsticks is a paradigm for the sort of competition for resources which goes on inside operating systems.
	www.duke.edu /web/cps001/labs/lab9/lab9.html (1669 words)

	NetLogo Models Library: Dining Philosophers
		The Dining Philosophers problem is a classic case study in the synchronization of concurrent processes.
		Philosophers know which fork is on their left and which fork is on their right.
		For example, suppose there is one salt shaker on the table where all the philosophers can reach it, and suppose that each time a philosopher has acquired both forks, she must acquire the salt shaker and salt her spaghetti before she begins eating.
	ccl.northwestern.edu /netlogo/models/DiningPhilosophers (1424 words)

	SEM - Generalized Dining Philosophers - 10/12/02 - Cachan - France (Site not responding. Last check: 2007-10-20)
		In the classic formulation the philosophers sit at a round table and there is a fork between any two philophers.
		In the early 80's, Lehman and Rabin showed that there exist no deterministic, symmetric and fully distributed solution to the problem of the dining philosophers, and they proposed two randomized solutions: one which guarrantees deadlock freedom with probability 1 and another one which guarrantees lockout freedom with probability 1.
		The solution to the generalized dining philosophers is used to solve the conflicts associated to the competition for channels arising in presence of guarded-choices commands.
	pauillac.inria.fr /pipermail/gtlogique/2002-November/000354.html (512 words)

	Dining Philosophers (Site not responding. Last check: 2007-10-20)
		Write a solution to the Dining Philosophers problem that is free from the possibility of deadlock (but uses all 5 philosophers).
		Each philosopher should have a separate id, but execute the same thread procedure (i.e., write a single "philosopher" function that takes the id number as an argument).
		Each philosopher should suspend itself for a random period of time uniformly distributed between 0.25 and 2 seconds while eating or thinking.
	www.mcs.csuhayward.edu /~tebo/Classes/4560/philosophers.html (274 words)

	Dining Philosophers
		Five philosophers are seated around a circular table with a fork placed between each two neighbouring philosophers.
		A philosopher spends his time alternatively between a phase of thinking that it is succeded by a phase in which he is hungry, followed by an eating phase.
		Initially, all the philosophers are in their thinking phase and all the forks are free.
	www.fdaw.unimaas.nl /education/3.2is/Philosophers (205 words)

	Portable Dining Philosophers
		Dijkstra's famous "dining philosophers" problem [Dijkstra 71] is used as a vehicle for developing a program rich enough in system construction problems to be realistic yet small enough to be manageable in a classroom situation.
		A philosopher's life is ruled by the algorithm in Figure 3, which is adapted from the task body for the philosopher type.
		Each philosopher determines the length of the next meal or thinking session by drawing a random integer from 1 to 10; pseudo-random numbers are delivered by a function in the random numbers package.
	www.seas.gwu.edu /~mfeldman/papers/portable-diners.html (2696 words)

	PRISM - Case Studies - Dining Philosophers (Lynch, Saias and Segala)
		This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81] and the analysis of this algorithm by Lynch, Saias and Segala [LSS94].
		This is a stronger assumption than that of Lynch, Saias and Segala, and hence we consider a smaller class of adversaries or schedulers.
		In the following, N denotes the number of philosophers and K is as above, i.e.
	www.cs.bham.ac.uk /~dxp/prism/casestudies/phil_lss.php (760 words)

	The Dining Philosophers Problem. Part 1.
		This article is dedicated to the famous dining philosophers' problem, which was proposed by Edward Dijkstra in 1965.
		This is a Dijkstra's original formulation of the problem; since most philosophers (as well as most programmers) can eat spaghetti with a single fork, modern writers use the Chinese food and chopsticks instead of spaghetti and forks.
		Each philosopher is an individual working thread, the thread executes the following actions cyclically: thinking, waiting for the left fork, taking the left fork when it is free, waiting for the right fork, taking the right fork, eating.
	www.suite101.com /article.cfm/7240/84301 (394 words)

	The Dining Philosophers in REST
		Each philosopher has a ticket indicating their identity; we'll ignore the specifics of how these are obtained, authenticated, etc. The goal of the client is to obtain the required two forks in order to eat.
		One waiter is tasked with observing the table and, at a philosopher's request and if possible, taking from the philosopher their ticket, removing the two adjacent forks from the table and handing them to the philosopher.
		The general state of the problem is modeled as usual as an array representing the state of the philosophers and an array of semaphores.
	www.xent.com /pipermail/fork/2001-August/002923.html (2550 words)

	Dining Philosophers (Site not responding. Last check: 2007-10-20)
		Each philosopher should be able to eat as much as the rest.
		To ensure that two philosophers do not simultaneously grab the same stick, a synchronized method is used.
		The new state of each philosopher is re-painted on top of the old one.
	jliusun.bradley.edu /~jiangbo/appletdemo/DiningPhilosophers/demo.html (346 words)

	PRISM - Case Studies - Dining Philosophers
		This case study is based on Lehmann and Rabin's [LR81] randomised solution to the well known dining philosophers problem.
		This algorithm is Lehmann and Rabin's [LR81] solution to the well known dining philosophers problem.
		This algorithm is the version of Lehmann and Rabin's dining philosopher algorithm presented in [DFP04] and does not require any fairness assumptions.
	www.cs.bham.ac.uk /~dxp/prism/casestudies/phil.php (828 words)

	C-Kermit Case Study #27 (Site not responding. Last check: 2007-10-20)
		The Philosophers sit around a table where there is a bowl of rice and five chopsticks.
		The philosopher objects compete for chopsticks which are binary semaphore objects.
		The philosopher object sends the request to the winepool which assigns an availble bottle to the philosopher or puts him on a queue for the bottle with the least numbers of waiting philosophers for it.
	www.columbia.edu /kermit/case27.html (502 words)

	Dining Philosophers (Site not responding. Last check: 2007-10-20)
		N philosophers are seated in a circle, one chopstick between each adjacent pair
		Each philosopher needs two chopsticks to eat, a left chopstick and a right chopstick
		A typical philosopher process alternates between eating and thinking (see next slide)
	www.cs.toronto.edu /~culhane/Teaching/209-Fall97/Slides/sld190.htm (39 words)

	Source of: Win32/diningphilosophers.cpp
		To prevent * deadlock only four philosophers will be allowed to be in the dining room * at a time.
		Philosophers will wait forever to pick up a chopstick.
		Note that in // this simulation, the chopsticks, table and reporter are not threads, only // the philosophers are.
	www.technocage.com /~ray/viewsource.jsp?Win32/diningphilosophers.cpp (666 words)

	Ancient Greek Philosophers dining philosophers java solution (Site not responding. Last check: 2007-10-20)
		When you are looking for top-quality information relating to dining philosophers java solution, you'll find it difficult sorting out quality information from ill-equiped dining philosophers java solution suggestions and help so it's astute to know ways of moderating the information presented to you.
		A great tip to follow when you're presented with help or advice concerning a dining philosophers java solution web page is to find out who owns the site.
		This may show you who owns the site dining philosophers java solution credibility The easiest way to work out who is at the back of the dining philosophers java solution web site is to look on the 'about' page or the sites 'contact' page.
	www.ancient-greek-philosophers.info /dining-philosophers-java-solution.htm (249 words)

	David's Philosophers (Site not responding. Last check: 2007-10-20)
		The Dining Philosophers is a classic concurrent programming problem that illustrates the pitfalls of multithreaded applications.
		Simply put, the Dining Philosophers scenario is five philosophers sitting around a table doing what they do best: thinking and eating.
		The philosophers spend most of their time thinking, but when they get hungry they reach for the two sticks next to them and start eating.
	www-cs-students.stanford.edu /~dwhitney/java/DiningPhilosophers (309 words)

	Dining Philosophers Problem from FOLDOC
		The problem consists of a finite set of processes which share a finite set of resources, each of which can be used by only one process at a time, thus leading to potential deadlock.
		The DPP visualises this as a number of philosophers sitting round a dining table with a fork between each adjacent pair.
		Each philosopher may arbitrarily decide to use either the fork to his left or the one to his right but each fork may only be used by one philosopher at a time.
	ftp.sunet.se /foldoc/foldoc.cgi?Dining+Philosophers+Problem (261 words)

	Satan Comes to Dinner
		The classes are written in E, an extended Java subset that provides message passing, orthogonal persistence, and capability-based security.
		If the event was not canceled, then revoke the fork and issue a new one to the other philosopher.
		A philosopher is not necessarily made by a fork dispenser, but it is initialized by a fork dispenser.
	www.crockford.com /ec/dining.html (3478 words)

Try your search on: Qwika (all wikis)