skip to content
A simple near-optimal solution to the drinking philosophers problem Preview this item
ClosePreview this item
Checking...

A simple near-optimal solution to the drinking philosophers problem

Author: David Ginat; A Udaya Shankar; Ashok K Agrawala
Publisher: College Park, Md. : University of Maryland, 1989.
Series: Computer science technical report series (University of Maryland at College Park), CS-TR-2122.1.
Edition/Format:   Book : English : Rev. Nov. 1989View all editions and formats
Database:WorldCat
Summary:
Abstract: "We provide a solution to the drinking philosophers problem, defined by Chandy and Misra [1]. Our solution, unlike theirs, does not have a dining layer. By using bounded session numbers with occasional resets, we are able to reduce the message complexity per drinking session from the order of neighbors a philosopher has to the order of bottles he needs for drinking."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: David Ginat; A Udaya Shankar; Ashok K Agrawala
OCLC Number: 22619292
Description: 12 pages ; 28 cm.
Series Title: Computer science technical report series (University of Maryland at College Park), CS-TR-2122.1.
Responsibility: David Ginat, A. Udaya Shankar and A.K. Agrawala.

Abstract:

Abstract: "We provide a solution to the drinking philosophers problem, defined by Chandy and Misra [1]. Our solution, unlike theirs, does not have a dining layer. By using bounded session numbers with occasional resets, we are able to reduce the message complexity per drinking session from the order of neighbors a philosopher has to the order of bottles he needs for drinking."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/22619292>
library:oclcnum"22619292"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:bookEdition"Rev. Nov. 1989."
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "We provide a solution to the drinking philosophers problem, defined by Chandy and Misra [1]. Our solution, unlike theirs, does not have a dining layer. By using bounded session numbers with occasional resets, we are able to reduce the message complexity per drinking session from the order of neighbors a philosopher has to the order of bottles he needs for drinking.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/24201170>
schema:inLanguage"en"
schema:isPartOf
schema:name"A simple near-optimal solution to the drinking philosophers problem"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.