哲学家进餐问题

在多线程中如何避免死锁。



问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考

要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分

别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每

只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem descr iption : 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