Producer Consumer problem - mutex and semaphore

很典型的一道多线程题目。如果使用BlockingQueue,就十分简单。但是要注意blockingqueue的语法,用put/take

package concurrent;

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

public class ProducerConsumerBlockingQueue {
    static BlockingQueue<Integer> queue = new LinkedBlockingQueue<Integer>();

    public static void main(String[] args) {
        new Thread(new Producer()).start();
        new Thread(new Consumer()).start();
    }

    private static class Producer implements Runnable {
        @Override
        public void run() {
            for (int i = 0; i < 5; i++) {
                try {
                    queue.put(i);
                    Thread.sleep(100);
                } catch (InterruptedException e) {
                }
                System.out.println("queue offer " + i);
            }
        }
    }

    private static class Consumer implements Runnable {
        @Override
        public void run() {
            try {
                System.out.println("queue.take " + queue.take());
                System.out.println("queue.take " + queue.take());
                System.out.println("queue.take " + queue.take());
                System.out.println("queue.take " + queue.take());
                System.out.println("queue.take " + queue.take());
            } catch (InterruptedException e) {
            }
        }
    }

}


下面是自己实现的两个线程,使用mutex 方法 wait() and notify()

package concurrent;

import java.util.LinkedList;
import java.util.Queue;
import java.util.concurrent.Semaphore;

public class ProducerConsumer {
    static Queue<Integer> queue = new LinkedList<Integer>();

    public static void main(String[] args) {
        new Thread(new Producer()).start();
        new Thread(new Consumer()).start();
    }

    private static class Producer implements Runnable {
        @Override
        public void run() {
            for (int i = 0; i < 10; i++) {
                while (queue.size() > 1) {
                    try {
                        queue.wait();
                    } catch (Exception e) {
                    }
                }
                synchronized (queue) {
                    queue.offer(i);
                    System.out.println("queue offer " + i);
                    queue.notify();
                }
            }
        }
    }

    private static class Consumer implements Runnable {
        @Override
        public void run() {
            while (true) {
                synchronized (queue) {
                    while (queue.isEmpty()) {
                        try {
                            queue.wait();
                        } catch (InterruptedException e) {
                        }
                    }
                    int i = queue.poll();
                    System.out.println("queue poll " + i);
                    queue.notify();
                }
            }
        }
    }
}

输出:

queue offer 0
queue offer 1
queue poll 0
queue poll 1
queue offer 2
queue offer 3
queue poll 2
queue poll 3
queue offer 4
queue offer 5
queue poll 4
queue poll 5
queue offer 6
queue offer 7
queue poll 6
queue poll 7
queue offer 8
queue offer 9
queue poll 8
queue poll 9

几个需要注意的地方:

1. 因为两个Thread都对queue进行操作,所有读写操作都需要用synchronizd关键字保证mutex

2. 在Producer里面我们有一个地方是while(queue.size()>1)。这么做是因为我想生产者消费者轮流放入和取出。如果没有这个while循环,生产者会任意生产10个数,而消费者取出的顺序也会随机。

比如:

queue offer 0
queue poll 0
queue offer 1
queue poll 1
queue offer 2
queue poll 2
queue offer 3
queue poll 3
queue offer 4
queue offer 5
queue offer 6
queue offer 7
queue offer 8
queue offer 9
queue poll 4
queue poll 5
queue poll 6
queue poll 7
queue poll 8
queue poll 9

用信号量实现同样的功能就简单了许多,不再使用synchronized关键字,不需要while循环。

为什么呢? 因为第一种方法实现的是monitor,使用busy wait,他会不断的check;而信号量就像红绿灯一样,一个thread通知下一个thread,下一个thread才可以执行,所以两个thread都不需要busy wait或者不可能有两个thread同时操作一个变量的情况。

package concurrent;

import java.util.LinkedList;
import java.util.Queue;
import java.util.concurrent.Semaphore;

public class ProducerConsumerSemaphore {
    static Queue<Integer> queue = new LinkedList<Integer>();
    static Semaphore semaphore_consume = new Semaphore(0);
    static Semaphore semaphore_produce = new Semaphore(1);

    public static void main(String[] args) {
        new Thread(new Producer()).start();
        new Thread(new Consumer()).start();
    }

    private static class Producer implements Runnable {
        @Override
        public void run() {
            for (int i = 0; i < 10; i++) {
                try {
                    semaphore_produce.acquire();
                } catch (InterruptedException e) {
                }
                queue.offer(i);
                System.out.println("queue offer " + i);
                semaphore_consume.release();
            }
        }
    }

    private static class Consumer implements Runnable {
        @Override
        public void run() {
            while (true) {
                try {
                    semaphore_consume.acquire();
                } catch (InterruptedException e) {
                }
                int i = queue.poll();
                System.out.println("queue poll " + i);
                semaphore_produce.release();
            }
        }
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值