java并发之手写生产者消费者模型

1 lock await signal方式

class ShareData{
	private volatile int number = 0;
	private int MAX_VALUE = 3;
	private int MIN_VALUE = 0;
	Lock lock = new ReentrantLock();
	Condition condition = lock.newCondition();
	public void increment() {
		lock.lock();
		try {
			while(number >= MAX_VALUE) {				
				System.out.println("库存已到最大值,无法继续生产");
				condition.await();
			}
			number++;
			System.out.println(Thread.currentThread().getName()+"生产一件产品,剩余"+number);
			condition.signalAll();
		} catch (Exception e) {
			e.printStackTrace();
		}finally {
			lock.unlock();
		}
	}
	public void decrement() {
		lock.lock();
		try {
			while(number <= MIN_VALUE) {
				System.out.println("库存为0,无法消费");
				condition.await();
			}
			number--;
			System.out.println(Thread.currentThread().getName()+"消费产品,剩余"+number);
			condition.signalAll();
		} catch (Exception e) {
			e.printStackTrace();
		}finally {
			lock.unlock();
		}
	}
}
public class ProdConsumerDemo {
	public static void main(String[] args) {
		ShareData shareData = new ShareData();
		for (int i = 0; i < 50; i++) {			
			new Thread(()->{
				for (int j = 0; j < 50; j++) {
					shareData.decrement();				
				}
			},"consumer"+String.valueOf(i)).start();
		}
		for (int j = 0; j < 50; j++) {			
			new Thread(()->{
				for(int i = 0; i < 50; i++) {
					shareData.increment();
				}
			},"productor"+String.valueOf(j)).start();
		}
	}
}

2阻塞队列方式

class MyResource{
	private BlockingQueue<Integer> blockingQueue = null;
	private AtomicInteger atomicInteger = new AtomicInteger();
	private volatile boolean flag = true;
	public MyResource(BlockingQueue<Integer> blockingQueue) {
		this.blockingQueue = blockingQueue;
	}
	public void product() throws InterruptedException {
		while(flag) {
			boolean res = blockingQueue.offer(atomicInteger.incrementAndGet(), 1L, TimeUnit.SECONDS);
			if(res) {
				System.out.println("inserting success");
			}else {
				System.out.println("inserting failed");
			}
		}
	}
	public void consume() throws InterruptedException {
		while(flag) {
		    Integer t = blockingQueue.poll(2L, TimeUnit.SECONDS);
		    if(t == null) {
		    	flag = false;
		    	System.out.println("等待2秒后无法消费,退出");
		    	return;
		    }else {
		    	System.out.println("consuming success");
		    }
		}
	}
	public void stop() {
		flag = false;
	}
	
}
public class ProdConsumerDemo2 {
	public static void main(String[] args) {
		MyResource myResource = new MyResource(new ArrayBlockingQueue<>(3));
		new Thread(()->{
			for (int i = 0; i < 5; i++) {
				try {
					myResource.product();
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
		},"productor").start();
		new Thread(()->{
			for (int i = 0; i < 5; i++) {
				try {
					myResource.consume();
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
		},"comsumer").start();
		try {
			TimeUnit.SECONDS.sleep(10);
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		myResource.stop();
	}
}

3 synchronized wait notify方式

未完待续

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值