生产者消费者问题的三种解法 - java

1.使用wait、notify

package com.gyq.pc;

import java.util.LinkedList;
import java.util.Queue;

/**
 * Created by andrewgyq on 2015/2/9.
 */
public class WaitNotifyDemo {
    public static void main(String[] args) {
        final Queue sharedQ = new LinkedList();

        Thread producer = new Producer(sharedQ);
        Thread consumer = new Consumer(sharedQ);

        producer.start();
        consumer.start();
    }
}

class Producer extends Thread{
    private final Queue sharedQ;

    public Producer(Queue sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
        for (int i = 0; i < 4; i++){
            synchronized (sharedQ){
                while (sharedQ.size() >= 1){
                    try {
                        System.out.println("Queue is full, Producer waiting");
                        sharedQ.wait();
                    }catch (InterruptedException ex){
                        ex.printStackTrace();
                    }
                }
                System.out.println("producing : " + i);
                sharedQ.add(i);
                sharedQ.notify();
            }
        }
    }
}

class Consumer extends Thread{
    private final Queue sharedQ;

    public Consumer(Queue sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
       while(true){
            synchronized (sharedQ){
                while (sharedQ.size() == 0){
                    try {
                        System.out.println("Queue is empty, Consumer waiting");
                        sharedQ.wait();
                    }catch (InterruptedException ex){
                        ex.printStackTrace();
                    }
                }
                int number = (Integer)sharedQ.poll();
                System.out.println("consuming : " + number);
                sharedQ.notify();

                if(number == 3){break; }
            }
        }
    }
}
2.使用阻塞队列
package com.gyq.pc;

import java.util.concurrent.BlockingQueue;
import java.util.concurrent.LinkedBlockingQueue;

/**
 * Created by andrewgyq on 2015/2/9.
 */
public class BlockingQueueDemo {
    public static void main(String[] args) {
        BlockingQueue sharedQ = new LinkedBlockingQueue();

        Thread producer = new BQProducer(sharedQ);
        Thread consumer = new BQConsumer(sharedQ);

        producer.start();
        consumer.start();
    }
}

class BQProducer extends Thread{
    private final BlockingQueue sharedQ;

    public BQProducer(BlockingQueue sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
        for (int i = 0; i < 4; i++){
            try{
                System.out.println("producing :" + i);
                sharedQ.put(i);
            }catch (InterruptedException ex){
                ex.printStackTrace();
            }
        }
    }
}

class BQConsumer extends Thread{
    private final BlockingQueue sharedQ;

    public BQConsumer(BlockingQueue sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
        while(true){
            try{
                System.out.println("consuming :" + sharedQ.take());
            }catch (InterruptedException ex){
                ex.printStackTrace();
            }
        }
    }
}
3.使用信号量

package com.gyq.pc;

import java.util.concurrent.Semaphore;

/**
 * Created by andrewgyq on 2015/2/10.
 */
public class SemaphoreDemo {
    public static void main(String[] args) {
        SharedQ sharedQ = new SharedQ();

        Thread producer = new SProducer(sharedQ);
        Thread consumer = new SConsumer(sharedQ);

        producer.start();
        consumer.start();
    }
}

class SharedQ{
    private int value;
    static Semaphore semCon = new Semaphore(0);
    static Semaphore semPro = new Semaphore(1);

    public void get(){
        try{
            semCon.acquire();
        }catch (InterruptedException ex){
            ex.printStackTrace();
        }
        System.out.println("consuming: " + value);
        semPro.release();
    }

    public void put(int n){
        try{
            semPro.acquire();
        }catch (InterruptedException ex){
            ex.printStackTrace();
        }
        this.value = n;
        System.out.println("producing: " + n);
        semCon.release();
    }
}

class SProducer extends Thread{
    private final SharedQ sharedQ;

    public SProducer(SharedQ sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
        for (int i = 0; i < 4; i++){
            sharedQ.put(i);
        }
    }
}

class SConsumer extends Thread{
    private final SharedQ sharedQ;

    public SConsumer(SharedQ sharedQ){
        this.sharedQ = sharedQ;
    }

    @Override
    public void run() {
        for (int i = 0; i < 4; i++){
            sharedQ.get();
        }
    }
}


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值