操作系统实验报告2.docxVIP

计算机操作系统实验报告 问题描述 基于线程的生产者--消费者问题仿真（生产者和消费者共享20个单元的缓冲区，使用lock锁） 设计方案 通过在Lock对象上调用newCondition()方法，将条件变量和一个锁对象进行绑定，进而控制并发程序访问竞争资源的安全。 实现程序 import java.util.LinkedList;import java.util.concurrent.locks.Condition;import java.util.concurrent.locks.Lock;import java.util.concurrent.locks.ReentrantLock;public class ProAndCon { public static final int MAX_SIZE = 20; public static LinkedListInteger list = new LinkedList(); public static Lock lock = new ReentrantLock(); public static Condition full = lock.newCondition(); //仓库满的条件变量 public static Condition empty = lock.newCondition(); //仓库空的条件变量 class Producer implements Runnable { @Override public void run() { lock.lock(); while (list.size() == MAX_SIZE) { try { System.out.println(仓库已满,不可生产.); full.await(); } catch (InterruptedException e) { e.printStackTrace(); } } list.add(1); System.out.println(生产者 + Thread.currentThread().getName() + 生产, 容量为 + list.size()); full.signal(); empty.signal(); lock.unlock(); } } class Consumer implements Runnable { @Override public void run() { lock.lock(); while (list.size() == 0) { try { System.out.println(仓库为空,不可消费); empty.await(); } catch (InterruptedException e) { e.printStackTrace(); } } list.removeFirst(); System.out.println(消费者 + Thread.currentThread().getName() + 消费，容量为 + list.size()); full.signal(); empty.signal(); lock.unlock(); } } public static void main(String[] args) { ProAndCon proAndCon = new ProAndCon(); Producer producer = proAndCon.new Producer();