Java多线程之生产者-消费者模型的三种写法（Synchronized、ReentrantLock、ArrayBlockingQueue）

---

生产者-消费者

生产者：不停的生产商品，当商品超出库存，不能再生产

消费者：不停的消费商品，当商品库存为零，不能再消费

---

一、代码（Synchronized实现）

/**
 * @author 弹弹霹雳
 * @create 2020-11-22-21:14
 */
public class TestProductorAndConsumer {
    public static void main(String[] args) {
         Clerk clerk = new  Clerk();
         Productor pro = new  Productor(clerk);
         Consumer cus = new  Consumer(clerk);

        new Thread(pro, "生产者1").start();
        new Thread(cus, "消费者1").start();
        new Thread(pro, "生产者2").start();
        new Thread(cus, "消费者2").start();
    }
}

//店员
class Clerk{
    private int product = 0;
    //进货
    public synchronized void get(){
        while(product >= 3){
            System.out.println("产品已满");
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        System.out.println(Thread.currentThread().getName() + "：当前产品数量由：" + product + "->" + ++product);
        notifyAll();
    }
	//卖货
    public synchronized void sale(){
        while(product <= 0){
            System.out.println("缺货!");
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        System.out.println(Thread.currentThread().getName() + "：当前产品数量由：" + product + "->" + --product);
        notifyAll();
    }
}

//生产者
class Productor implements Runnable{
    private  Clerk clerk;
    public Productor( Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 0; i < 10; i++){
            clerk.get();
        }
    }
}
//消费者
class Consumer implements Runnable{
    private  Clerk clerk;
    public Consumer( Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 0; i < 10; i++){
            clerk.sale();
        }
    }
}

运行结果：

二、代码（ReentrantLock实现)

package com.shaocoder.java;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

/**
 * @author 弹弹霹雳
 * @create 2020-11-22-21:14
 */
public class TestProductorAndConsumerForLock {
    public static void main(String[] args) {
        Clerk clerk = new Clerk();

        Productor pro = new Productor(clerk);
        Consumer cus = new Consumer(clerk);

        new Thread(pro, "生产者1").start();
        new Thread(cus, "消费者1").start();
        new Thread(pro, "生产者2").start();
        new Thread(cus, "消费者2").start();
    }
}

//店员
class Clerk{
    private int product = 0;
    private Lock lock = new ReentrantLock();
    private Condition condition = lock.newCondition();
    //进货
    public void get(){
        lock.lock();
        try{
            while(product >= 3){
                System.out.println("产品已满");
                try {
                    condition.await();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            System.out.println(Thread.currentThread().getName() + "：当前产品数量由：" + product + "->" + ++product);
            condition.signalAll();
        }finally{
            lock.unlock();
        }
    }

    public void sale(){
        lock.lock();
        try{
            while(product <= 0){
                System.out.println("缺货!");
                try {
                    condition.await();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            System.out.println(Thread.currentThread().getName() + "：当前产品数量由：" + product + "->" + --product);
            condition.signalAll();
        }finally{
            lock.unlock();
        }
    }
}

//生产者
class Productor implements Runnable{
    private Clerk clerk;
    public Productor(Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 0; i < 5; i++){
            clerk.get();
        }
    }
}

//消费者
class Consumer implements Runnable{
    private Clerk clerk;
    public Consumer(Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 0; i < 5; i++){
            clerk.sale();
        }
    }
}

运行结果：

三、代码（ArrayBlockingQueue实现)

package com.shaocoder.java;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;

/**
 * @author 弹弹霹雳
 * @create 2020-11-23-18:55
 */
public class TestBlockQueueProductorAndConsumer {
    public static void main(String[] args) {
        Clerk clerk = new Clerk();
        Productor productor = new Productor(clerk);
        Consumer consumer = new Consumer(clerk);
        new Thread(productor, "生产者1").start();
        new Thread(productor, "生产者2").start();
        new Thread(consumer, "消费者1").start();
        new Thread(consumer, "消费者2").start();
    }
}
class Clerk{
    private BlockingQueue<String> queue = new ArrayBlockingQueue<>(3);

    public void product(){
        try {
            queue.put("product");
            System.out.println(Thread.currentThread().getName() + ",生产了，产品数量还剩：" + queue.size());
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
    public void consume(){
        try {
            queue.take();
            System.out.println(Thread.currentThread().getName() + ",消费了，产品数量还剩：" + queue.size());
        } catch (InterruptedException e) {
            e.printStackTrace();
        }

    }
}
class Productor implements Runnable{
    private Clerk clerk;
    public Productor(Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 1; i <= 5; i++){
            clerk.product();
        }
    }
}
class Consumer implements Runnable{
    private Clerk clerk;
    public Consumer(Clerk clerk){
        this.clerk = clerk;
    }
    @Override
    public void run() {
        for(int i = 1; i <= 5; i++){
            clerk.consume();
        }
    }
}

运行结果：

这里有一点需要说一下，使用阻塞队列实现生产者和消费者时，会发现输出的顺序和实际生产消费顺序不一致，那是因为put方法和take方法没有和print方法同步导致的。就比如说，生产者1生产了一个产品，它还没打印，另外一个生产者2也生产了一个产品，之后生产者1打印产品数量时就变成了2个。虽然输出不符合生产者消费者的顺序，但是其内部运算仍然符合生产者和消费者顺序。