Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/24201170

A simple near-optimal solution to the drinking philosophers problem

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."

Open All Close All

type

http://www.w3.org/1999/02/22-rdf-syntax-ns#type

http://schema.org/CreativeWork

about

http://schema.org/about

author

http://schema.org/author

contributor

http://schema.org/contributor

creator

http://schema.org/creator

description

http://schema.org/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

name

http://schema.org/name

"A simple near-optimal solution to the drinking philosophers problem"
"A simple near-optimal solution to the drinking philosophers problem"@en

workExample

http://schema.org/workExample