我有一个Java生产者和消费者示例的简单变体。我认为应该可以，但是挂起了。我最初认为这可能是某种形式的死锁，但是当我查看线程转储时，它似乎陷入了无限循环的中间。无论如何，我不明白为什么程序的行为如此奇怪，并且想知道可能导致挂起的情况。
public class ProducerConsumer {
public static void main(String[] args) {
Buffer buffer = new Buffer(7);
Producer producer = new Producer(buffer);
Consumer consumer = new Consumer(buffer);
producer.start();
consumer.start();
}
}
class Buffer{
private char [] buffer;
private int count = 0, in = 0, out = 0;
private final Object object1 = new Object();
Buffer(int size){
buffer = new char[size];
}
public void put (char c) {
while(count == buffer.length) ;
synchronized(object1) {
System.out.println("Producing" + c + "...");
buffer[in] = c;
in = (in + 1) % buffer.length;
count++;
}
}
public char get() {
while(count == 0) ;
char c = buffer[out];
synchronized(object1) {
out = (out + 1) % buffer.length;
count--;
System.out.println("Consuming" + c + "...");
}
return c;
}
}
class Producer extends Thread {
private Buffer buffer;
Producer(Buffer b){
buffer = b;
}
public void run() {
for(int i = 0; i < 10; i++) {
buffer.put((char) ('A' + i%26 ));
}
}
}
class Consumer extends Thread {
private Buffer buffer;
Consumer(Buffer b){
buffer = b;
}
public void run() {
for(int i = 0; i < 10; i++) {
buffer.get();
}
}
}
这是程序输出及其线程转储。
c:\Temp\tt>java ProducerConsumer
ProducingA...
ConsumingA...
ProducingB...
ConsumingB...
ProducingC...
ConsumingC...
ProducingD...
ConsumingD...
ProducingE...
ConsumingE...
ProducingF...
ConsumingF...
ProducingG...
ConsumingG...
ProducingH...
ConsumingH...
ProducingI...
ProducingJ...
2019-12-08 22:28:51
Full thread dump Java HotSpot(TM) 64-Bit Server VM (25.231-b11 mixed mode):
"DestroyJavaVM" #13 prio=5 os_prio=0 tid=0x0000000002761800 nid=0x3990 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"Thread-1" #12 prio=5 os_prio=0 tid=0x000000003a12a800 nid=0x36f0 runnable [0x000000003b04f000]
java.lang.Thread.State: RUNNABLE
at Buffer.get(ProducerConsumer.java:36)
at Consumer.run(ProducerConsumer.java:71)
"Service Thread" #10 daemon prio=9 os_prio=0 tid=0x000000003a0ff000 nid=0x30a4 runnable [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"C1 CompilerThread3" #9 daemon prio=9 os_prio=2 tid=0x000000003a05a000 nid=0x3890 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"C2 CompilerThread2" #8 daemon prio=9 os_prio=2 tid=0x000000003a057000 nid=0x16a4 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"C2 CompilerThread1" #7 daemon prio=9 os_prio=2 tid=0x000000003a055000 nid=0x4b4 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"C2 CompilerThread0" #6 daemon prio=9 os_prio=2 tid=0x000000003a04d800 nid=0x4160 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"Attach Listener" #5 daemon prio=5 os_prio=2 tid=0x0000000039ff9000 nid=0x1028 runnable [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"Signal Dispatcher" #4 daemon prio=9 os_prio=2 tid=0x0000000039ff7800 nid=0x4f80 waiting on condition [0x0000000000000000]
java.lang.Thread.State: RUNNABLE
"Finalizer" #3 daemon prio=8 os_prio=1 tid=0x0000000039fe1800 nid=0x21c in Object.wait() [0x000000003a5be000]
java.lang.Thread.State: WAITING (on object monitor)
at java.lang.Object.wait(Native Method)
- waiting on <0x000000066c408ed8> (a java.lang.ref.ReferenceQueue$Lock)
at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:144)
- locked <0x000000066c408ed8> (a java.lang.ref.ReferenceQueue$Lock)
at java.lang.ref.ReferenceQueue.remove(ReferenceQueue.java:165)
at java.lang.ref.Finalizer$FinalizerThread.run(Finalizer.java:216)
"Reference Handler" #2 daemon prio=10 os_prio=2 tid=0x0000000039fe0800 nid=0x4588 in Object.wait() [0x000000003a4bf000]
java.lang.Thread.State: WAITING (on object monitor)
at java.lang.Object.wait(Native Method)
- waiting on <0x000000066c406c00> (a java.lang.ref.Reference$Lock)
at java.lang.Object.wait(Object.java:502)
at java.lang.ref.Reference.tryHandlePending(Reference.java:191)
- locked <0x000000066c406c00> (a java.lang.ref.Reference$Lock)
at java.lang.ref.Reference$ReferenceHandler.run(Reference.java:153)
"VM Thread" os_prio=2 tid=0x00000000381e9800 nid=0x5418 runnable
"GC task thread#0 (ParallelGC)" os_prio=0 tid=0x0000000002776800 nid=0x2580 runnable
"GC task thread#1 (ParallelGC)" os_prio=0 tid=0x0000000002778000 nid=0x4c98 runnable
"GC task thread#2 (ParallelGC)" os_prio=0 tid=0x000000000277a000 nid=0x560c runnable
"GC task thread#3 (ParallelGC)" os_prio=0 tid=0x000000000277b800 nid=0x3e78 runnable
"GC task thread#4 (ParallelGC)" os_prio=0 tid=0x000000000277d800 nid=0x1f24 runnable
"GC task thread#5 (ParallelGC)" os_prio=0 tid=0x0000000002780000 nid=0x5074 runnable
"GC task thread#6 (ParallelGC)" os_prio=0 tid=0x0000000002783000 nid=0x3d88 runnable
"GC task thread#7 (ParallelGC)" os_prio=0 tid=0x0000000002784000 nid=0x4d18 runnable
"VM Periodic Task Thread" os_prio=2 tid=0x000000003a11c800 nid=0x3f8c waiting on condition
JNI global references: 5
Heap
PSYoungGen total 304640K, used 31335K [0x000000066c400000, 0x0000000681800000, 0x00000007c0000000)
eden space 261120K, 12% used [0x000000066c400000,0x000000066e299c00,0x000000067c300000)
from space 43520K, 0% used [0x000000067ed80000,0x000000067ed80000,0x0000000681800000)
to space 43520K, 0% used [0x000000067c300000,0x000000067c300000,0x000000067ed80000)
ParOldGen total 696320K, used 0K [0x00000003c4c00000, 0x00000003ef400000, 0x000000066c400000)
object space 696320K, 0% used [0x00000003c4c00000,0x00000003c4c00000,0x00000003ef400000)
Metaspace used 2642K, capacity 4492K, committed 4864K, reserved 1056768K
class space used 283K, capacity 388K, committed 512K, reserved 1048576K
任何提示将不胜感激。
如上所述，在注释循环中检查条件确实很危险。解决方案之一是具有两个条件Empty和Full，并且当Consumer检查计数为0时，它会等待Empty，如果生产者检查计数是否已达到极限，则会在Full上等待。然后，当计数小于限制时，消费者分别唤醒生产者，而当计数不为0时，生产者唤醒消费者。
要回答您的问题，死锁如何发生：
消费者线程采用count变量的值，并希望进行比较，但是在比较之前，生产者线程设法填充缓冲区并进入while循环。然后，消费者将其计数比较为0并陷入循环。两个线程都在等待，例如Consumer的计数为0，Producer的计数为缓冲区的大小。在进行同步时，我的建议是计算每种可能的情况，首先了解您可以将哪些操作视为原子操作，这意味着两个不同的线程无法同时执行此操作。
希望我的共同知识对您有帮助。
P.S。我不确定您是否可以算作AtomicInteger来避免死锁，但至少可以尝试这种方法。但是无论如何，请避免在多线程中使用while循环检查条件。
当您的使用者线程在生产者线程之前开始使用时，将出现上述情况。您可以在其中进行一些睡眠来模拟它。
Buffer buffer = new Buffer(7);
Producer producer = new Producer(buffer);
Consumer consumer = new Consumer(buffer);
consumer.start();
Thread.sleep(2000);
producer.start();
现在要修复它，您可以使用等待并根据每个人的建议进行通知。
我已经更新了缓冲区代码。请检查是否适合您。
class Buffer{
private char [] buffer;
private int count = 0, in = 0, out = 0;
private final Object object1 = new Object();
Buffer(int size){
buffer = new char[size];
}
public void put (char c) throws InterruptedException {
//while(count == buffer.length) ;
synchronized(object1) {
if(count == buffer.length){
object1.wait();
}
System.out.println("Producing" + c + "...");
buffer[in] = c;
in = (in + 1) % buffer.length;
count++;
object1.notify();
}
}
public char get() throws InterruptedException {
//while(count == 0) ;
while (true){
synchronized(object1) {
if(count == 0){
object1.wait();
}
char c = buffer[out];
out = (out + 1) % buffer.length;
count--;
System.out.println("Consuming" + c + "...");
object1.notify();
return c;
}
}
}
}
答案：CLICK HERE
我有一个Java生产者和消费者示例的简单变体。我认为应该可以，但是挂起了。我首先认为这可能是某种形式的死锁，但是当我查看线程转储时，它>>