Abstract
We introduce a new solution to the drinking philosophers problem, using drinking session numbers. It is simple and easily adjusted to extensions of the problem. The number of messages per drinking session is between zero and twice the number of bottles needed for drinking, a considerable improvement over previous work.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chandy, M. and Misra, J., “The drinking philosophers problem,” ACM Trans. Prog. Lang. Syst., Vol. 6, 4, Oct. 1984, pp. 632–646.
Chandy, M. and Misra, J., “An example of stepwise refinement of distributed programs: quiescence detection,” ACM Trans. Prog. Lang. Syst., Vol. 8, 3, July 1986, pp. 326–343.
Dijkstra, E.W., “Two starvation free solutions to a general exclusion problem,” EWD 625.
Ginat, D., “Decentralized ordering of contending processes in a distributed system,” PhD Thesis, Computer Science Dept., Univ. of Maryland, in preparation.
Lamport, L., “Time, clocks, and the ordering of events in a distributed system,” Commun. ACM, Vol. 21, 7, July 1978, pp. 558–564.
Lynch, N.A., “Fast allocation of nearby resources in a distributed system,” Proc. of the 12th ACM Symp. on Theory of Computing, 1980, pp. 70–81.
Murphy, S.L. and Shankar, A.U., “A note on the drinking philosophers,” ACM Trans. on Prog. Lang. and Syst., Vol. 10, No. 1, pp. 178–188, January 1988.
Ricart, G., and Agrawala, A.K., “An optimal algorithm for mutual exclusion in computer networks,” Commun. ACM, Vol. 24, 1, Jan. 1981, pp. 9–17.
Shankar, A.U., and Lam, S.S., “Time-dependent distributed systems: proving safety, liveness and real-time properties,” Distributed Computing, Vol. 2, No. 2, Springer-Verlag, 1987.
Styer, E. and Peterson G.L., “Improved algorithms for distributed resource allocation,” Proceedings of The Seventh Annual ACM Symposium on Principles of Distributed Computing, August 1988, pp. 105–116.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ginat, D., Shankar, A.U., Agrawala, A.K. (1989). An efficient solution to the drinking philosophers problem and its extensions. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_34
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive