An efficient solution to the drinking philosophers problem and its extensions

David Ginat, A. Udaya Shankar, A. K. Agrawala

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationDistributed Algorithms - 3rd International Workshop, Proceedings
EditorsJean-Claude Bermond, Michel Raynal
PublisherSpringer Verlag
Pages83-93
Number of pages11
ISBN (Print)9783540516873
DOIs
StatePublished - 1989
Externally publishedYes
Event3rd International Workshop on Distributed Algorithms, WDAG 1989 - Nice, France
Duration: 26 Sep 198928 Sep 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Distributed Algorithms, WDAG 1989
Country/TerritoryFrance
CityNice
Period26/09/8928/09/89

Fingerprint

Dive into the research topics of 'An efficient solution to the drinking philosophers problem and its extensions'. Together they form a unique fingerprint.

Cite this