Drinking philosophers problem

From Wikipedia, the free encyclopedia

While the Dining philosophers problem aims to model process interaction and contention, its solution does not capture the dynamics of real machines. It assumes that all processes always need the same set of fixed resources, when real programs' needs may change over time.

The Drinking Philosophers Problem is an extension of the original problem, where each process may need a different set of resources at different points in time. It was proposed and solved in 1984 by K.M. Chandy and J. Misra.

[edit] References

Chandy, K.M.; Misra, J. (1984). The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../d/r/i/Drinking_philosophers_problem.html"