哲学家就餐问题

哲学家就餐问题在计算机操作系统中是一个很经典的问题，曾经我在我的操作系统课程设计中用C语言做过一个哲学家就餐问题的模拟。当时做得非常的吃力，因为确实在C语言这方面学的东西太少，关于进程的编程都是靠着看那本操作系统的实验册，实验册很薄啊，里面的东西确实是很有限啊，做得很郁闷。当时我和那代码谁也不认识谁，搞了2，3个晚上，好不容易弄出个东西，连进程并发都不会，但由于时间所限，只能草草交差，一直很遗憾啊。

后来学习corejava学到Thread这部分的时候有感而发，虽然线程不是进程，但线程毕竟是进程的最小单位，确实是有很多相似之处。所以小试牛刀，做了这么一个对哲学家就餐问题的模拟，也希望高手多多指教。

//哲学家类public class ZheXJ {boolean leftChick = false;boolean rightChick = false;String name;public void getLChick(Chick c) {//拿起左筷子方法while (!this.leftChick) {c.bTake();this.leftChick = true;System.out.println(this.name + " say:I get the leftchick "+c.getNum()+" !");}}public void getRChick(Chick c) {//拿起右筷子方法while (!this.rightChick) {c.bTake();this.rightChick = true;System.out.println(this.name + " say:I get the rightchick "+c.getNum()+" !");}}public void putLChick(Chick c) {//放下左筷子方法while (this.leftChick) {c.bPut();this.leftChick = false;System.out.println(this.name + " say:I put the leftchick "+c.getNum()+" !");}}public void putRChick(Chick c) {//放下右筷子方法while (this.rightChick) {c.bPut();this.rightChick = false;System.out.println(this.name + " say:I put the rightchick "+c.getNum()+" !");}}public boolean eat(){if(leftChick && rightChick) return true;else return false;}}//筷子类public class Chick {boolean chick = false;private int num;public Chick(int num) {this.num = num;}public void bPut() {//筷子被拿起while (chick) {chick = false;}}public void bTake() {//筷子被放下while (!chick) {chick = true;}}public int getNum() {return num;}}//哲学家进程类，它继承了哲学家类，主要用于生成线程，以及相关的操作import java.util.*;public class ZheXJThread extends ZheXJ implements Runnable {//每个哲学家对应的左右筷子private Chick lC;private Chick rC;public ZheXJThread() {super();}public ZheXJThread(Chick lc, Chick rc, String name) {super();this.setLC(lc);this.setRC(rc);this.name = name;}public Chick getLC() {return lC;}public void setLC(Chick lc) {lC = lc;}public Chick getRC() {return rC;}public void setRC(Chick rc) {rC = rc;}@Overridepublic void run() {while (true) {int i = new Random().nextInt(3) + 1;System.out.println(this.name + " say:I will think " + i+ " second!");try {Thread.sleep(i * 1000);} catch (Exception e) {e.printStackTrace();}System.out.println(this.name + " say:I want to eat");/*while (true) {// 解决死锁的一种方案if (this.rC.chick)continue;elsebreak;}*/synchronized (lC) {while (!this.leftChick) {this.getLChick(this.lC);}try {Thread.sleep(4000);} catch (Exception e) {e.printStackTrace();}synchronized (rC) {while (!this.rightChick) {this.getRChick(this.rC);}if (this.eat()) {i = new Random().nextInt(3) + 1;System.out.println(this.name + " say:I will eat " + i+ " second!");try {Thread.sleep(i * 1000);} catch (Exception e) {e.printStackTrace();}}this.putRChick(rC);}this.putLChick(lC);}}}}//最后是Testpublic class TestZxj {public static void main(String[] args) {Chick[] ck = new Chick[5];ZheXJThread[] zhjxh = new ZheXJThread[5];for(int i=0;i<ck.length;i++){ck[i] = new Chick(i);}for(int i=0;i<zhjxh.length;i++){if(i==0)zhjxh[i] = new ZheXJThread(ck[4-i],ck[0],"ZXJ"+(i+1));elsezhjxh[i] = new ZheXJThread(ck[4-i],ck[5-i],"ZXJ"+(i+1));}for(int i=0;i<zhjxh.length;i++){new Thread(zhjxh[i]).start();}}}