Wanted: Solutions for IPC problem

Article View: comp.os.os2

Article #141

#141

From: Chunming Qiao
Date: Fri, 10 Nov 1989 02:54

14 lines
1332 bytes

Hi, does anyone out there know how to find the solutions (stavation-free)
to the classic Dining Philosophers problem (distributed/centralized) ?
what about the solutions to river-crossing (readers/writers) problem ?

Furthermore, the comparizon (analytical / simulation) between different
solutions to the problem ?  Has anybody done that before ?

I'd very much appreciate your answer. Please reply to
  						qiao@vax.cs.pitt.edu 

Thanks you very much in advance.

-Chunming

Technical Details

Message-ID: <6207@pitt.UUCP>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!pt.cs.cmu.edu!cadre.dsl.pitt.edu!pitt!qiao

References: <1989Nov2.185611.2956@mks.com>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!pt.cs.cmu.edu!cadre.dsl.pitt.edu!pitt!qiao
From: qiao@pitt.UUCP (Chunming Qiao)
Newsgroups: comp.os.os2
Subject: Wanted: Solutions for IPC problem
Summary: Stavation free solution for Dining Philosophers problem,
         river crossing problem(see Peterson's book "O.S. Concept"),
         Or stavation-free solution to readers/writers problem.
         Either distributed(using mesg passing) or centrelized
Keywords: IPC, Stavation free, Dining Philosopher, Rivercross, readers/writers
          distributed, centrelized solutions.
Message-ID: <6207@pitt.UUCP>
Date: 10 Nov 89 02:54:04 GMT
References: <1989Nov2.185611.2956@mks.com>
Reply-To: qiao@vax.cs.pitt.edu.UUCP (Chunming Qiao)
Organization: Univ. of Pittsburgh Computer Science
Lines: 14

Reply to Parent Message