qiao@pitt.UUCP (Chunming Qiao) (11/10/89)
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