生产者消费者问题

这篇博客探讨了Java并发编程中synchronized和Lock的使用。首先展示了synchronized版本的生产者消费者问题,然后解释了在多线程环境下可能出现的虚假唤醒问题,并通过改用while循环来解决。接着,介绍了使用Lock和Condition实现更精确的线程通知和唤醒。最后,讨论了Lock如何帮助避免八锁现象,提高了并发控制的精度。
摘要由CSDN通过智能技术生成

1、synchronized版本(判断等待、业务、通知)

1.1当有两条线程时

/**
 * 线程之间的通信问题:生产和消费者问题 等待唤醒 通知唤醒
 * 线程交替执行AB 操作同一个变量 num = 0
 */
public class TestPC {
    public static void main(String[] args){
        Data data = new Data();
        new Thread(()->{ for (int i = 0; i < 5; i++)data.increment();},"A").start();
        new Thread(()->{ for (int i = 0; i < 5; i++)data.decrement();},"B").start();
    }
}
//等待,业务,通知
class Data{
    private int num = 0;
    //+1
    public synchronized void increment(){
        if(num != 0){//等待
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        num++;
        System.out.println(Thread.currentThread().getName()+"->"+num);
        //通知其他线程,我+1完成
        this.notifyAll();
    }
    //-1
    public synchronized void decrement(){
        if(num == 0){//等待
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        num--;
        System.out.println(Thread.currentThread().getName()+"->"+num);
        //通知其他线程,我-1完成
        this.notifyAll();
    }
}

1.2当有4条线程时(虚假唤醒)

 因此,将if判断改为while判断

2、Lock版本的生产者消费者

public class JUCTestPC {
    public static void main(String[] args){
        Data1 data = new Data1();
        new Thread(()->{ for (int i = 0; i < 10; i++)data.increment();},"A").start();
        new Thread(()->{ for (int i = 0; i < 10; i++)data.decrement();},"B").start();
        new Thread(()->{ for (int i = 0; i < 10; i++)data.increment();},"C").start();
        new Thread(()->{ for (int i = 0; i < 10; i++)data.decrement();},"D").start();
    }
}
//等待,业务,通知
class Data1{
    private int num = 0;
    Lock lock = new ReentrantLock();
    Condition condition = lock.newCondition();
    //+1
    public void increment(){
        lock.lock();
        try {
            while(num != 0){//等待
                condition.await();
            }
            num++;
            System.out.println(Thread.currentThread().getName()+"->"+num);
            //通知其他线程,我+1完成
            condition.signalAll();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }

    //-1
    public void decrement(){
        lock.lock();
        try {
            while(num == 0){//等待
                condition.await();
            }
            num--;
            System.out.println(Thread.currentThread().getName()+"->"+num);
            //通知其他线程,我-1完成
            condition.signalAll();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
}

3、Condition精确通知和唤醒线程

//多监视器实现,1:A  2:B  3:C
//精准唤醒某个监视器

public class JUCTestConditionPC {
    public static void main(String[] args) {
        Data3 data3 = new Data3();
        new Thread(()->{ for (int i = 0; i < 5; i++) data3.printA(); },"A").start();
        new Thread(()->{ for (int i = 0; i < 5; i++) data3.printB(); },"B").start();
        new Thread(()->{ for (int i = 0; i < 5; i++) data3.printC(); },"C").start();
    }
}

class Data3{
    private int num = 1;

    private Lock lock = new ReentrantLock();

    Condition condition1 = lock.newCondition();
    Condition condition2 = lock.newCondition();
    Condition condition3 = lock.newCondition();

    public void printA(){
        lock.lock();
        try {
            while(num!=1){
                condition1.await();
            }
            num = 2;
            System.out.println(Thread.currentThread().getName()+"->AAA");
            condition2.signalAll();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }

    public void printB(){
        lock.lock();
        try {
            while(num!=2){
                condition2.await();
            }
            num = 3;
            System.out.println(Thread.currentThread().getName()+"->BBB");
            condition3.signalAll();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }

    public void printC(){
        lock.lock();
        try {
            while(num!=3){
                condition3.await();
            }
            num = 1;
            System.out.println(Thread.currentThread().getName()+"->CCC");
            condition1.signalAll();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
}

4、八锁现象

Synchronized修饰的普通同步方法锁的是对象

static synchronized 锁的是一个class

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值