生产者-消费者模型的两种实现方式

方式一:利用阻塞队列来实现

生产者:

improt java.util.Random;
import java.util.concurrent.BlockingQueue;

public class Producer implements Runnable{
	private final BlockingQueue<Integer> queue;
	private String name;
	public Producer(BlockingQueue<Integer> queue, String name){
		this.queue = queue;
		this.name = name;
	}
	@Override 
	public void run(){
		while(true){
			try{
				Thread.sleep(1000);
				queue.put(producer());
			}catch(Exception e){
				e.printStackTrace();
			}
		}
	}

	private int producer(){
		int n  = new Random.nextInt(1000);
		System.out.println("Thread: "+name + "Producer: " + n);
		return n;
	}
}

消费者:

import java.util.concurrent.BlockingQueue;
public class Consumer implements Runnable{
	private String name;
	private BlockingQueue<Integer> queue;
	public Consumer(BlockQueue<Integer> queue, String name){
		this.queue = queue;
		this.name = name;
	}
	@Overrider
	public void run(){
		try{
			Thread.sleep(1000);
			cusumer(queue.take());
		}
		catch(Exception e){
			e.printStackTrace();
		}
	}
	public void consumer(Integer n){
		System.out.println("Thread : " + name + "Consumer" +n );
	}
}

测试:

public static void main(String args[]){
	BlockingQueue<Integer> queue = new ArrayBlockingQueue<Integer>(5);
	Producer p = new Producer(queue, "生产者");
	Consumer c1 = new Consumer(queue, "消费者1");
	Consumer c2 = new Consumer(queue, "消费者2");
	new Thread(p).start();
	new Thread(c1).start();
	new Thread(c2).start();
}

方式二:利用wait()和notify()方法

生产者:

import java.util.Queue;
import java.util.Random;

public class Producer implements Runnable{
	private int size;
	private Queue<Integer> queue;
	public Producer(Queue<Integer> queue, itn size){
		this.queue = queue;
		this.size = size;
	}
	@Override
	public void run(){
		while(true){
			synchronized(queue){
				while(queue.size == size){
					System.out.println("Queue is Full");
					try{
						queue.wait();
					}catch(Exception e){
						e.printStackTrace();
					}
				}
				Random random = new Random();
				int i = random.nextInt();
				System.out,println("生产者:"+i);
				queue.add(i);
				queue.notifyAll();
			}
		}
	}
}

消费者:

import java.util.Queue;
public class Consumer implement Runnable{
	private Queue<Integer> queue;
	private int size;
	public Consumer(Queue<Integer> queue, int size){
		this.queue = queue;
		this.size = size;
	}
	@Override 
	public void run(){
		while(true){
			synchronized(queue){
				while(queue.isEmpty){
					System.out.println("Queue is Empty");
					try{
						queue.wait();
					}catch(Exception e){
						e.printStackTrace();
					}
				}
				int v = queue.remove();
				System.out.println("消费者: " +i);
				queue.notifyAll();
			}
		}
	}
}

测试:

public static void main(String args[]){
	Queue<Integer> queue = new LinkedList<>();
	int size = 10;
	Producer p = new Producer(queue, size);
	Consumer c1 = new Consumer(queue, size);
	Consumer c2 = new Consumer(queue, size);
	new Thread(p).start();
	new Thread(c1).start();
	new Thread(c2).start();
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值