博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
生产者消费者 Java
阅读量:191 次
发布时间:2019-02-28

本文共 5486 字,大约阅读时间需要 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/

你可能感兴趣的文章