三种消费者生产者模式写法

最新推荐文章于 2024-04-23 21:32:14 发布

Sonihr

最新推荐文章于 2024-04-23 21:32:14 发布

阅读量310

点赞数

CC 4.0 BY-SA版权

分类专栏： Java学习文章标签：生产者消费者

本文链接：https://blog.youkuaiyun.com/w8253497062015/article/details/90147428

Java学习专栏收录该内容

38 篇文章

订阅专栏

本文探讨了生产者消费者模式在多线程环境下的实现，通过三种不同的方式：使用synchronized关键字、ReentrantLock锁和Condition条件变量、以及使用LinkedBlockingQueue阻塞队列，展示了如何在Java中有效协调生产者和消费者之间的数据交换。

package ConcurrentSource;/*
@author 黄大宁Rhinos
@date 2019/5/12 - 22:33
**/

import java.util.LinkedList;
import java.util.Queue;

public class CustomerAndProducer01 {
    private Queue<Integer> queue;
    private int maxSize;
    CustomerAndProducer01(int maxSize){
        this.queue = new LinkedList<Integer>();
        this.maxSize = maxSize;
    }
    class Customer implements Runnable{
        public void use(){
            synchronized (queue){
                while(queue.size()==0){
                    try {
                        queue.wait();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
                queue.poll();
                System.out.println(Thread.currentThread().getName() + "消费后还有"+queue.size());
                queue.notifyAll();
            }
        }
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(300);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                use();
            }
        }
    }
    class Producer implements Runnable{
        public void produce(){
            synchronized (queue){
                while(queue.size()==maxSize){
                    try {
                        queue.wait();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
                queue.offer(1);
                System.out.println(Thread.currentThread().getName() +"生产后还有"+queue.size());
                queue.notifyAll();
            }
        }
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(1000);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                produce();
            }

        }
    }

    public static void main(String[] args) {
        CustomerAndProducer01 cp = new CustomerAndProducer01(10);
        for(int i=0;i<10;i++){
            new Thread(cp.new Customer()).start();
        }
        for(int i=0;i<5;i++){
            new Thread(cp.new Producer()).start();
        }
    }
}

package ConcurrentSource;/*
@author 黄大宁Rhinos
@date 2019/5/12 - 23:18
**/

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

public class CustomerAndProducer02 {
    private Queue<Integer> queue;
    private int maxSize;
    private Lock lock;
    private Condition isFull;
    private Condition isEmpty;
    CustomerAndProducer02(int maxSize){
        this.queue = new LinkedList<Integer>();
        this.maxSize = maxSize;
        this.lock = new ReentrantLock();
        isEmpty = lock.newCondition();
        isFull = lock.newCondition();
    }
    class Customer implements Runnable{
        public void use(){
            lock.lock();
            try{
                while(queue.size()==0){
                    try {
                        isEmpty.await();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
                queue.poll();
                System.out.println(Thread.currentThread().getName() + "消费后还有"+queue.size());
                isFull.signalAll();
            }finally {
                lock.unlock();
            }
        }
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(300);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                use();
            }
        }
    }
    class Producer implements Runnable{
        public void produce(){
            lock.lock();
            try{
                while(queue.size()==maxSize){
                    try {
                        isFull.await();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
                queue.offer(1);
                System.out.println(Thread.currentThread().getName() + "消费后还有"+queue.size());
                isEmpty.signalAll();
            }finally {
                lock.unlock();
            }
        }
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(1000);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                produce();
            }

        }
    }

    public static void main(String[] args) {
        CustomerAndProducer02 cp = new CustomerAndProducer02(10);
        for(int i=0;i<10;i++){
            new Thread(cp.new Customer()).start();
        }
        for(int i=0;i<5;i++){
            new Thread(cp.new Producer()).start();
        }
    }
}

package ConcurrentSource;/*
@author 黄大宁Rhinos
@date 2019/5/12 - 23:27
**/

import java.util.concurrent.LinkedBlockingQueue;


public class CustomerAndProducer03 {
    private LinkedBlockingQueue queue;
    private int maxSize;
    CustomerAndProducer03(int maxSize){
        this.queue = new LinkedBlockingQueue(maxSize);
        this.maxSize = maxSize;
    }

    class Customer implements Runnable{
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(300);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                try {
                    queue.take();
                    System.out.println(Thread.currentThread().getName() + "消费后还有"+queue.size());
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        }
    }
    class Producer implements Runnable{
        @Override
        public void run() {
            for(int i=0;i<5;i++){
                try {
                    Thread.sleep(1000);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                try {
                    queue.put(1);
                    System.out.println(Thread.currentThread().getName() + "生产后还有"+queue.size());
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }

        }
    }
    public static void main(String[] args) {
        CustomerAndProducer03 cp = new CustomerAndProducer03(10);
        for(int i=0;i<10;i++){
            new Thread(cp.new Customer()).start();
        }
        for(int i=0;i<5;i++){
            new Thread(cp.new Producer()).start();
        }
    }
}