【发布时间】:2013-09-28 20:30:03
【问题描述】:
我正在开发一个 Java 项目来模拟 dining philosophers problem。
我从基本行为开始,每个线程 think()、getForks()、eat() 和 putForks()。因此无法防止死锁或饥饿(故意这样做)。
getForks() 方法的工作原理如下:
getForks(){
while(forks[rightFork]==0) /*0 means fork is not on the table, so wait*/
print(Thread #id waiting for right fork);
forks[rightFork] = 0;
while(forks[leftFork]==0)
print(Thread #id waiting for left fork);
forks[leftFork = 0;
}
我在获得右叉和左叉之间设置了一个 sleep(5000),因此程序陷入死锁(每个线程都持有右叉)。然而,出乎意料的是,由于某种原因,一旦到达死锁,执行就会停止。我预计在死锁期间会继续打印“Thread #id waiting for fork”消息,但事实并非如此。一旦达到死锁,就不会再打印消息了。
有什么线索吗?
如果你想查看整个代码,这里是:
public class Philosophers{
private static final int NUMBER = 3;
private static final int MIN_SLEEP = 1000;
private static final int MAX_SLEEP = 6000;
private static Thread[] threads = new Thread[NUMBER];
private static int[] forksArray = new int[8];
private static void start(){
System.out.println("Simulation started.");
//Initialize forks array (1 means on the table)
for(int i=0;i<7;i++)
forksArray[i] = 1;
//Create and start individual threads
for(int i=0;i<NUMBER;i++){
threads[i] = new Thread(new Philosopher(i));
threads[i].start();
}
}
public static void main(String[] args){
javax.swing.SwingUtilities.invokeLater(new Runnable() {
public void run() {
start();
}
});
}
private static class Philosopher implements Runnable{
private int id;
private int leftFork;
private int rightFork;
public void run(){
System.out.println("Thread "+id+" started.");
while(true){
think();
getForks();
eat();
putForks();
}
}
public Philosopher(int id){
this.id = id;
this.rightFork = id;
if(id==NUMBER - 1)
this.leftFork = 0;
else
this.leftFork = id + 1;
}
public void think(){
System.out.println("Thread "+id+" thinking...");
try{
int sleepInterval = MIN_SLEEP + (int)(Math.random() * ((MAX_SLEEP - MIN_SLEEP) + 1));
Thread.sleep(sleepInterval);
}
catch(Exception e){
System.out.println(e);
}
}
public void getForks(){
System.out.println("Thread "+id+" getting forks.");
//Grab fork on the right
while(forksArray[rightFork]==0)
System.out.println("Thread "+id+" waiting for right fork");
forksArray[rightFork] = 0;
try{
Thread.sleep(5000);
}
catch(Exception e){
}
//Grab fork on the left
while(forksArray[leftFork]==0);
System.out.println("Thread "+id+" waiting for left fork");
forksArray[leftFork] = 0;
}
public void eat(){
System.out.println("Thread "+id+" eating.");
try{
Thread.sleep(2000);
}
catch(Exception e){
System.out.println(e);
}
}
public void putForks(){
System.out.println("Thread "+id+" putting forks down.");
forksArray[rightFork] = 1;
forksArray[leftFork] = 1;
}
}
}
【问题讨论】:
-
不看实际代码就无法判断——你使用锁吗?同步块?
-
@assylias,给你。
标签: java multithreading concurrency deadlock