博客
关于我
生产者消费者 Java
阅读量:193 次
发布时间:2019-02-28

本文共 5430 字,大约阅读时间需要 18 分钟。

synchronized实现

public class App {       private int num;    /**     * 生产     */    public void product() {           try {               // 生产耗时            Thread.sleep(1000);            synchronized (this) {                   while (num >= 100) {                       wait();                }                num++;                System.out.println("生产");                System.out.println("库存量:" + num);                notifyAll();            }        } catch (InterruptedException e) {               e.printStackTrace();        }    }    /**     * 消费     */    public void sell() {           try {               // 卖出耗时            Thread.sleep(500);            synchronized (this) {                   while (num <= 0) {                       wait();                }                num--;                System.out.println("卖出");                System.out.println("库存量:" + num);                notifyAll();            }        } catch (InterruptedException e) {               e.printStackTrace();        }    }    public static void main(String[] args) throws Exception {           App app = new App();        Runnable product = new Runnable() {               @Override            public void run() {                   while (true) {                       app.product();                }            }        };        Runnable sell = new Runnable() {               @Override            public void run() {                   while (true) {                       app.sell();                }            }        };        for (int i = 0; i < 5; i++) {               System.out.println("投产");            new Thread(product).start();        }        for (int i = 0; i < 10; i++) {               System.out.println("销售");            new Thread(sell).start();        }    }}

阻塞队列实现

import java.util.concurrent.ArrayBlockingQueue;import java.util.concurrent.BlockingQueue;import java.util.concurrent.atomic.AtomicInteger;public class App {       private BlockingQueue
blockingQueue=new ArrayBlockingQueue<>(100); private AtomicInteger atomicInteger=new AtomicInteger(); /** * 生产 */ public void product() { try { // 生产耗时 Thread.sleep(1000); blockingQueue.offer(atomicInteger.incrementAndGet()); System.out.println("工厂"+Thread.currentThread().getName()+"生产\n库存量:" + blockingQueue.size()); } catch (InterruptedException e) { e.printStackTrace(); } } /** * 消费 */ public void sell() { try { // 卖出耗时 Thread.sleep(500); System.out.println("消费者"+Thread.currentThread().getName()+"购买"+blockingQueue.take()+"号商品\n库存量:" + blockingQueue.size()); } catch (InterruptedException e) { e.printStackTrace(); } } public static void main(String[] args) throws Exception { App app = new App(); Runnable product = new Runnable() { @Override public void run() { while (true) { app.product(); } } }; Runnable sell = new Runnable() { @Override public void run() { while (true) { app.sell(); } } }; for (int i = 0; i < 3; i++) { System.out.println("投产"); new Thread(product).start(); } for (int i = 0; i < 5; i++) { System.out.println("销售"); new Thread(sell).start(); } }}

ReentrantLock实现

import java.util.concurrent.locks.Condition;import java.util.concurrent.locks.ReentrantLock;public class App {       private ReentrantLock lock = new ReentrantLock();    private final Condition notFull = lock.newCondition();    private final Condition notEmpty = lock.newCondition();    private int num = 0;    public void product() {           try {               Thread.sleep(1000);            lock.lock();            while (num > 100) {                   notFull.await();            }            num++;            System.out.println("工厂" + Thread.currentThread().getName() + "生产\n库存:" + num);            notEmpty.signalAll();        } catch (Exception e) {               e.printStackTrace();        } finally {               lock.unlock();        }    }    public void sell() {           try {               Thread.sleep(800);            lock.lock();            while (num <= 0) {                   notEmpty.await();            }            num--;            System.out.println("顾客" + Thread.currentThread().getName() + "购买\n库存:" + num);            notFull.signalAll();        } catch (Exception e) {               e.printStackTrace();        } finally {               lock.unlock();        }    }    public static void main(String[] args) {           App app = new App();        for (int i = 0; i < 10; i++) {               new Thread(new Runnable() {                   @Override                public void run() {                       while (true) {                           app.product();                    }                }            }).start();        }        for (int i = 0; i < 5; i++) {               new Thread(new Runnable() {                   @Override                public void run() {                       while (true) {                           app.sell();                    }                }            }).start();        }    }}

转载地址:http://upvj.baihongyu.com/

你可能感兴趣的文章
Nagios介绍
查看>>
nagios利用NSCient监控远程window主机
查看>>
nagios安装文档
查看>>
nagios服务端安装
查看>>
Nagios自定义监控脚本
查看>>
name_save matlab
查看>>
Nami 项目使用教程
查看>>
Nancy之基于Nancy.Hosting.Aspnet的小Demo
查看>>
NAND NOR FLASH闪存产品概述
查看>>
nano 编辑
查看>>
nanoGPT 教程:从零开始训练语言模型
查看>>
NASA网站曝严重漏洞,或将沦为黑客钓鱼网站?
查看>>
Nash:轻量级、安全且可靠的脚本语言
查看>>
NAS、SAN和DAS的区别
查看>>
NAS个人云存储服务器搭建
查看>>
NAT PAT故障排除实战指南:从原理到技巧的深度探索
查看>>
nat 网卡间数据包转发_你是不是从来没有了解过光纤网卡,它跟普通网卡有什么区别?...
查看>>
NAT-DDNS内网穿透技术,快解析DDNS的优势
查看>>
NAT-DDNS内网穿透技术,快解析DDNS的优势
查看>>
NAT-DDNS内网穿透技术,解决动态域名解析难题
查看>>