Java ExecutorService 实现队列消费

package MultiThread;

import java.util.ArrayList;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class ListExample {
    private  static ArrayList<String>  list = new ArrayList<>();
    private  static  Object  lock = new Object();
    public static void main(String[] args) {

        ExecutorService executorService = Executors.newCachedThreadPool();
        executorService.execute(new Runnable() {
            @Override
            public void run() {
                //Thread.currentThread().setName("inputdata");
                synchronized (lock){
                    while (list.size()==0) {
                        list.add("data");
                        System.out.println(Thread.currentThread().getName()+":input data");
                        lock.notifyAll();
                        try {
                            lock.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                }

            }
        });

        executorService.execute(new Runnable() {
            @Override
            public void run() {
                //Thread.currentThread().setName("remove data");
                synchronized (lock){
                    while (list.size()==1){
                        try {
                            System.out.println(Thread.currentThread().getName()+":remove  data");
                            list.remove(0);
                            lock.notifyAll();
                            lock.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }

                    }
                }

            }
        });

    }

}
package MultiThread;

import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class ConcurrentLinkedQueueExaple {
    private  static ConcurrentLinkedQueue<String> queue = new ConcurrentLinkedQueue<>();
    private  static  Object  lock = new Object();
    public static void main(String[] args) {
        ExecutorService executorService = Executors.newCachedThreadPool();
        executorService.execute(new Runnable() {
            @Override
            public void run() {
                //Thread.currentThread().setName("inputdata");
                synchronized (lock){
                    while (queue.isEmpty()) {
                        queue.add("data");
                        System.out.println(Thread.currentThread().getName()+":input data");
                        lock.notifyAll();
                        try {
                            lock.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                }

            }
        });

        executorService.execute(new Runnable() {
            @Override
            public void run() {
                //Thread.currentThread().setName("remove data");
                synchronized (lock){
                    while (!queue.isEmpty()){
                        try {
                            System.out.println(Thread.currentThread().getName()+":remove  data");
                            queue.poll();
                            lock.notifyAll();
                            lock.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }

                    }
                }

            }
        });

    }
    }

 

生产者消费者模式是一种常见的并发编程模型,队列可以作为其实现方式之一。Java中可以使用BlockingQueue来实现队列的功能,具体步骤如下: 1. 定义一个BlockingQueue对象作为生产者和消费者之间的缓冲区。 ``` BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(10); ``` 2. 定义一个生产者类,该类会不断地向队列中添加数据,直到队列满为止。 ``` class Producer implements Runnable { private BlockingQueue<Integer> queue; public Producer(BlockingQueue<Integer> queue) { this.queue = queue; } public void run() { try { while (true) { int i = new Random().nextInt(); queue.put(i); System.out.println("生产者生产数据:" + i); Thread.sleep(1000); } } catch (InterruptedException e) { e.printStackTrace(); } } } ``` 3. 定义一个消费者类,该类会不断地从队列中取出数据,直到队列为空为止。 ``` class Consumer implements Runnable { private BlockingQueue<Integer> queue; public Consumer(BlockingQueue<Integer> queue) { this.queue = queue; } public void run() { try { while (true) { int i = queue.take(); System.out.println("消费消费数据:" + i); Thread.sleep(1000); } } catch (InterruptedException e) { e.printStackTrace(); } } } ``` 4. 创建一个线程池,并启动生产者和消费者线程。 ``` ExecutorService executor = Executors.newFixedThreadPool(2); executor.submit(new Producer(queue)); executor.submit(new Consumer(queue)); ``` 这样就完成了生产者消费者模式的实现。生产者会不断地向队列中添加数据,消费者会不断地从队列中取出数据,当队列满时,生产者会阻塞等待,当队列为空时,消费者会阻塞等待。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值