Path: utzoo!attcan!uunet!wuarchive!emory!hubcap!pandolfi
From: pandolfi@lifia.imag.fr (Xavier Pandolfi )
Newsgroups: comp.parallel
Subject: references on philosophers problem
Message-ID: <11072@hubcap.clemson.edu>
Date: 22 Oct 90 12:40:55 GMT
Sender: fpst@hubcap.clemson.edu
Reply-To: pandolfi@lifia.imag.fr (Xavier Pandolfi )
Organization: Lab. LIFIA  --  Univ. Grenoble
Lines: 27
Approved: parallel@hubcap.clemson.edu

Hello,

I am looking for articles/references concerning lower bounds 
for the number of messages the participating processes
need to send in the worst case in order to respect :
  1. the drinking philosophers problem
  2. the dining philosophers problem
  3. the mutual exclusion problem

when the solution under consideration is :
  a. standard
  b. without deadlock
  c. starvation free

Please send informations to E-mail address:

pandolfi@lifia.imag.fr

I can summarize to the net if enough interest.

thanks in advance,

-- 
-- Xavier Pandolfi
   LIFIA - IMAG				Tel : 76-57-46-58
   46, Av Felix Viallet			Mail : pandolfi@lifia.imag.fr
   38031 Grenoble Cedex, France