JUC之线程通信之生产者消费者传统版

向右看齐 2023-06-23 12:55 23阅读 0赞

### 线程通信之生产者消费者传统版 ###

用于哪里

一、生产者消费者  
1.传统版  
2.阻塞队列版

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0FCVV9NT2xJX0lUVUk_size_16_color_FFFFFF_t_70][]

package Lock;
    
    
    import java.util.concurrent.locks.Condition;
    import java.util.concurrent.locks.Lock;
    import java.util.concurrent.locks.ReentrantLock;
    
    //资源类
    class ShareData    {
    private int number =0;
    private Lock lock =new ReentrantLock();
    private Condition condition =lock.newCondition();
    
    
    public void increment()throws Exception{
        lock.lock();
        try {
    //1  判断
            while (number !=0){
                //等待，不能生产
                condition.await();
            }
            //2干活
            number++;
            System.out.println(Thread.currentThread().getName() + "\t" + number);
            //3通知唤醒
            condition.signalAll();
    
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    
    }
    
        public void decrement()throws Exception{
            lock.lock();
            try {
    //1  判断
                while (number ==0){
                    //等待，不能生产
                    condition.await();
                }
                //2干活
                number--;
                System.out.println(Thread.currentThread().getName() + "\t" + number);
                //3通知唤醒
                condition.signalAll();
    
            }catch (Exception e){
                e.printStackTrace();
            }finally {
                lock.unlock();
            }
    
        }
    }
    
    /*
    * 题目：一个初始值为0的变量，俩个线程对其交替操作，一个加一，一个减一，来5轮
    *
    * 1  线程  操作（方法）    资源类
    * 2  判断  干活    通知
    * 3防止虚假唤醒机制
    * */
    public class ProdConsumer_TraditionDemo {
        public static void main(String[] args) {
            ShareData shareData =new ShareData();
    
            new Thread(()->{
                for (int i = 1; i <=5 ; i++) {
                    try {
                        shareData.increment();
                    }catch (Exception e){
                        e.printStackTrace();
                    }
                }
            },"AA").start();
    
            new Thread(()->{
                for (int i = 1; i <=5 ; i++) {
                    try {
                        shareData.decrement();
                    }catch (Exception e){
                        e.printStackTrace();
                    }
                }
            },"BB").start();
    
            new Thread(()->{
                for (int i = 1; i <=5 ; i++) {
                    try {
                        shareData.increment();
                    }catch (Exception e){
                        e.printStackTrace();
                    }
                }
            },"CC").start();
    
            new Thread(()->{
                for (int i = 1; i <=5 ; i++) {
                    try {
                        shareData.decrement();
                    }catch (Exception e){
                        e.printStackTrace();
                    }
                }
            },"DD").start();
        }
    }

AA	1
    BB	0
    AA	1
    BB	0
    AA	1
    BB	0
    AA	1
    BB	0
    AA	1
    BB	0
    CC	1
    DD	0
    CC	1
    DD	0
    CC	1
    DD	0
    CC	1
    DD	0
    CC	1
    DD	0
    
    Process finished with exit code 0

二、线程池  
三、消息中间件

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0FCVV9NT2xJX0lUVUk_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/20191219092913707.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0FCVV9NT2xJX0lUVUk=,size_16,color_FFFFFF,t_70