Lock+Condition机制实现生产者消费者模型

本文详细介绍了如何借助Lock和Condition机制实现生产者消费者模型。通过创建Condition对象,能够精确控制线程间的同步,确保等待和唤醒操作的准确性,避免唤醒错误的线程。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

  • Lock里的 new Condition()会产生一个新的Condition(等待队列)对象
  • 利用Condition里面的await()singnal等待和唤醒自己队列的线程,不会唤醒不该唤醒的线程
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

class goods{
    private String name;
    private int count = 0;
    private int maxCount;
    public goods(int maxCount){
        this.maxCount = maxCount;
    }
    private Lock lock = new ReentrantLock();
    private Condition producer = lock.newCondition();
    private Condition consumer = lock.newCondition();
    public void Produce(String name){
        try {
            lock.lock();
            while (this.count == maxCount){
                System.out.println("商品数量已经达最大,等待消费者消费");
                producer.await();
            }
            this.name = name;
            System.out.println(Thread.currentThread().getName()+"生产"+(count++)+"商品");
            consumer.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
    public void Consume(){
        try {
            lock.lock();
            while (this.count == 0){
                System.out.println("商品已经被消费完,等待生产");
                consumer.await();
            }
            System.out.println(Thread.currentThread().getName()+"消费"+(count--)+"商品");
            producer.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }

    @Override
    public String toString() {
        return "goods{" +
                "name='" + name + '\'' +
                ", count=" + count +
                '}';
    }
}
class Producer implements Runnable{
    private goods good;
    public Producer(goods good){
        this.good = good;
    }
    @Override
    public void run() {
        while (true){
            this.good.Produce("anmuxi");
        }
    }
}
class Consumer implements Runnable{
    private goods good;
    public Consumer(goods good){
        this.good = good;
    }
    @Override
    public void run() {
       while (true){
            this.good.Consume();
        }
    }
}
public class produceConsum {
    public static void main(String[] args) {
        List<Thread> list = new ArrayList<>();
        goods good = new goods(10);
        Producer producer = new Producer(good);
        Consumer consumer = new Consumer(good);

        for (int i = 0;i < 2;i++){
            Thread thread = new Thread(producer,"生产"+i);
            list.add(thread);
        }
        for (int i = 0;i < 4;i++){
            Thread thread = new Thread(consumer,"消费"+i);
            list.add(thread);
        }
        for (Thread t:list) {
            t.start();
        }
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值