Java基于ReentrantLock类和Condition接口实现生产者消费者模型

测试用生产者模型:

package domain;

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

/**
 * 生产者模型
 * 
 * @author WanAkiko
 * 
 */
public class Producer implements Runnable {

	private Queue<String> queue;
	private ReentrantLock lock;
	private Condition condition;
	private Integer count = 0;
	int i = 1;

	public Producer(Queue<String> queue, ReentrantLock lock,
			Condition condition, Integer count) {
		super();
		this.queue = queue;
		this.lock = lock;
		this.condition = condition;
		this.count = count;
	}

	@Override
	public void run() {
		while (true) {
			lock.lock();
			while (queue.size() >= count) {
				try {
					condition.await(); // 线程通信或中断之前保持等待状态
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
			}
			try {
				Thread.sleep(1000);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			String msg = "生产序列-" + (i++);
			queue.add(msg);
			System.out.println("生产者线程:" + msg);
			condition.signal();
			lock.unlock();
		}
	}

}

测试用消费者模型:

package domain;

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

/**
 * 消费者模型
 * 
 * @author WanAkiko
 * 
 */
public class Consumer implements Runnable {

	private Queue<String> queue; // 消费者队列
	@SuppressWarnings("unused")
	private Integer count; // 消费数量
	private ReentrantLock lock; // 唯一对象锁
	private Condition condition; // 监视器

	public Consumer(Queue<String> queue, Integer count, ReentrantLock lock,
			Condition condition) {
		super();
		this.queue = queue;
		this.count = count;
		this.lock = lock;
		this.condition = condition;
	}

	@Override
	public void run() {
		while (true) {
			lock.lock(); // 获取互斥锁
			while (queue.isEmpty()) {
				try {
					condition.await(); // 线程通信或中断之前保持等待状态
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
			}
			try {
				Thread.sleep(1000);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			condition.signal();
			System.out.println("消费者线程:" + queue.remove());
			lock.unlock(); // 释放互斥锁
		}
	}
}

模型测试:

package client;

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

import domain.Consumer;
import domain.Producer;

public class PC02Test {

	public static void main(String[] args) {
		
		Queue<String> queue = new LinkedList<String>();
		ReentrantLock lock = new ReentrantLock();
		Condition condition = lock.newCondition();
		int count = 3;
		
		new Thread(new Producer(queue, lock, condition, count)).start();
		new Thread(new Consumer(queue, count, lock, condition)).start();
		
	}
	
}

运行示例:
在这里插入图片描述

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值