Description: 哲学家进餐问题
在多线程中如何避免死锁。
问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考
要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分
别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每
只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem description : five philosophers sitting around the table, each one philosopher or thinking either wait or eat. To eat, philosopher must take up the PRC chopsticks (up to around two ends) Unfortunately, chopsticks equal to the volume and philosopher, so each must chopsticks from two philosophers sharing Platform: |
Size: 34816 |
Author:何冰 |
Hits:
Description: 哲学家进餐问题MFC仿真程序
包括程序以及源代码及项目文件-Dining philosophers problem and the MFC process simulation program, including source code and project files Platform: |
Size: 397312 |
Author:llt |
Hits:
Description: 利用信号量方法进行哲学家就餐问题的死锁避免，把哲学家分为三种状态，思考，饥饿，进食，仅当一个哲学家左右两边的筷子都可用时，才允许他拿筷子，并且一次拿到两只筷子，否则不拿-Use semaphores method dining philosophers problem of deadlock avoidance, the philosopher into three states, thinking, hunger, eating only when both sides of a philosopher chopsticks are available, only allowing him to use chopsticks, and a get two chopsticks, or do not take Platform: |
Size: 1024 |
Author:Qing |
Hits:
Search - dining philosophers problem project