生产者消费者

核心思想:

  1. 组成:1、生产者;2、消费者;3、主题队列;
  2. 互助:生产者生产主题加入主题队列;消费者从主题队列中取出主题,消费主题;
  3. 互斥:生产者和消费者都持有主题队列,当队列中主题数达到队列上限,生产者停止生产,等待消费者消费;当队列中没有主题,消费者停止消费,等待生产者生产。

wait()和notifyAll()

wait()/ nofity()方法是基类Object的两个方法,也就意味着所有Java类都会拥有这两个方法,我们可以为任何对象实现同步机制。

  1. wait():当主题队列已满/空时,生产者/消费者线程停止自己的执行,放弃锁,使自己处于等待状态,让其他线程执行。
  2. notify():当生产者/消费者向生产队列放入/取出一个产品后,向其他等待的线程发出可执行的通知,同时放弃锁,使自己处于等待状态。
public class ProducerAndConsumerByObject {

    public static void main(String[] args) {
        ProducerAndConsumerByObject producerAndConsumerByObject = new ProducerAndConsumerByObject();
    }

    private static final int MAX_SIZE = 10;
    final LinkedList<Integer> subjects = new LinkedList<>();

    ProducerAndConsumerByObject() {
        doExample();

    }

    private void doExample() {
        Subject subject = new Subject();
        Producer p1 = new Producer(subject, "P1");
        Producer p2 = new Producer(subject, "P2");
        Producer p3 = new Producer(subject, "P3");
        Customer c1 = new Customer(subject, "C1");
        Customer c2 = new Customer(subject, "C2");
        p1.start();
        p2.start();
        p3.start();
        c1.start();
        c2.start();
    }



    public class Subject {
        private int i;
        Subject() {
        }
       // 生产者生产主题,加入队列
        void produce(String name) {
            while(true) {
                synchronized (subjects) {
                    while (subjects.size() == MAX_SIZE) {
                        try {
                            subjects.wait();
                            System.out.println("Queue is full, Producer wait");
                        } catch (Exception ex) {
                            ex.printStackTrace();
                        }
                    }
                    System.out.println(name + " Producer produces " + i);
                    subjects.offer(i++);
                    subjects.notifyAll();
                }
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }

        // 消费者消费主题,取出队列
        void customer(String name) {
            while(true) {
                synchronized (subjects) {
                    while (subjects.isEmpty()) {
                        try {
                            subjects.wait();
                            System.out.println("Queue is empty, Customer wait");
                        } catch (Exception ex) {
                            ex.printStackTrace();
                        }
                    }

                    Integer i = subjects.poll();
                    subjects.notifyAll();
                    System.out.println(name + " Customer cust " + i);
                }
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }
    }

    // 生产者,独立线程,在run方法中生产 
    public class Producer extends Thread {
        private Subject subject;
        private String name;
        Producer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + " is running");
            subject.produce(name);
        }
    }

    // 消费者,独立线程,在run方法中消费
    public class Customer extends Thread {
        private Subject subject;
        private String name;
        Customer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + " is running");
            subject.customer(name);
        }
    }
}

await()和signalAll()

上面的方式实现进程间同步依赖于synchronized,在简单场景下可以满足要求,但是在复杂场景下,对于锁需要更加细致的操作(条件满足,及时释放锁),因此需要用到lock.
await()signalAll()lock中实现同步的一种方式,基本和上述的wait()notifyAll()方法相同。通过lock.newCondition()获取condition,通过conditionawait()signlaAll()实现同步。

public class ProducerConsumerByLock {

    public static void main(String[] args) {
        ProducerConsumerByLock producerConsumerByLock = new ProducerConsumerByLock();
    }

    private static final int MAX_SIZE = 5;
    private static final Lock lock = new ReentrantLock();
    private static final Condition emptyCondition = lock.newCondition();
    private static final Condition fullCondition = lock.newCondition();
    private Queue<Integer> subject = new LinkedList<>();

    ProducerConsumerByLock() {
        doExample();
    }

    private void doExample() {
        Subject subject = new Subject();
        Producer p1 = new Producer(subject, "P1");
        Producer p2 = new Producer(subject, "P2");
        Producer p3 = new Producer(subject, "P3");
        Consumer c1 = new Consumer(subject, "C1");
        Consumer c2 = new Consumer(subject, "C2");
        p1.start();
        p2.start();
        p3.start();
        c1.start();
        c2.start();

    }


    public class Subject {
        int i = 0;

        public Subject(){
        }

        public void produce(String name) {
            while(true) {
                lock.lock();
                while (subject.size() == MAX_SIZE) {
                    try {
                        fullCondition.await();
                        System.out.println( name + " Queue is full");
                    } catch (InterruptedException ex) {
                        ex.printStackTrace();
                    }
                }
                System.out.println(name + " produce " + i);
                subject.offer(i++);
                fullCondition.signalAll();
                emptyCondition.signalAll();
                lock.unlock();
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }


        public void consume(String name) {
            while (true) {
                lock.lock();
                while (subject.size() == 0) {
                    try {
                        emptyCondition.await();
                        System.out.println(name + " Queue is empty");
                    } catch (InterruptedException ex) {
                        ex.printStackTrace();
                    }
                }
                int x = subject.poll();
                System.out.println(name + " consume " + x);
                fullCondition.signalAll();
                emptyCondition.signalAll();
                lock.unlock();
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }
    }


    public class Producer extends Thread {
        private Subject subject;
        private String name;
        Producer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + " is running");
            subject.produce(name);
        }
    }

    public class Consumer extends Thread {
        private Subject subject;
        private String name;
        Consumer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + " is running");
            subject.consume(name);
        }
    }
}

BlockingQueue

LinkedBlockingQueue是一个已经在内部实现了同步的队列,它可以在生成对象时指定容量大小。它利用await()signalAll()实现阻塞的入队出队操作,具体的方法为:

  1. put()方法:容量达到最大时,自动阻塞,生产者。
  2. take()方法:容量为0时,自动阻塞,消费者。
public class ProducerConsumerByBlockingQueue {


    public static void main(String[] args) {
        ProducerConsumerByBlockingQueue producerConsumerByBlockingQueue = new ProducerConsumerByBlockingQueue();
    }


    private static final int MAX_SIZE = 5;
    private LinkedBlockingQueue<Integer> subject = new LinkedBlockingQueue<>(MAX_SIZE);


    ProducerConsumerByBlockingQueue() {
        doExample();
    }

    private void doExample() {
        Subject subject = new Subject();
        Producer p1 = new Producer(subject, "P1");
        Producer p2 = new Producer(subject, "P2");
        Producer p3 = new Producer(subject, "P3");
        Consumer c1 = new Consumer(subject, "C1");
        Consumer c2 = new Consumer(subject, "C2");
        p1.start();
        p2.start();
        p3.start();
        c1.start();
        c2.start();

    }


    public class Subject {
        int i = 0;

        public Subject(){
        }

        public void produce(String name) {
            while(true) {
                try {
                    System.out.println(name + " produce " + i + " with size = " + subject.size());
                    subject.put(i++);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }


        public void consume(String name) {
            while (true) {
                try {
                    int x = subject.take();
                    System.out.println(name + " consumer " + x + " with size = " + subject.size());
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                try {
                    Thread.sleep(100);
                } catch (Exception ex) {
                    ex.printStackTrace();
                }
            }
        }
    }


    public class Producer extends Thread {
        private Subject subject;
        private String name;
        Producer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + "is running");
            subject.produce(name);
        }
    }

    public class Consumer extends Thread {
        private Subject subject;
        private String name;
        Consumer(Subject subject, String name) {
            this.subject = subject;
            this.name = name;
        }

        @Override
        public void run() {
            System.out.println(name + "is running");
            subject.consume(name);
        }
    }
}

Tips

需要注意到,生产者Producer和消费者Consumer在上述三种实现方式中完全一样,不同的只是Subject,这就做的好处:

  1. 使得生产者和消费者只有生产和消费的功能,而不需要知道如何生产和消费,提高了生产者和消费者的复用率(可以将Subject抽象化,传入不同的Subject子类)
  2. 使得Subject的逻辑变得完整,增加代码可读性,如何生产出,如何消费掉,一目了然。
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
  • 序言:七十年代末,一起剥皮案震惊了整个滨河市,随后出现的几起案子,更是在滨河造成了极大的恐慌,老刑警刘岩,带你破解...
    沈念sama阅读 211,743评论 6 492
  • 序言:滨河连续发生了三起死亡事件,死亡现场离奇诡异,居然都是意外死亡,警方通过查阅死者的电脑和手机,发现死者居然都...
    沈念sama阅读 90,296评论 3 385
  • 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
    开封第一讲书人阅读 157,285评论 0 348
  • 文/不坏的土叔 我叫张陵,是天一观的道长。 经常有香客问我,道长,这世上最难降的妖魔是什么? 我笑而不...
    开封第一讲书人阅读 56,485评论 1 283
  • 正文 为了忘掉前任,我火速办了婚礼,结果婚礼上,老公的妹妹穿的比我还像新娘。我一直安慰自己,他们只是感情好,可当我...
    茶点故事阅读 65,581评论 6 386
  • 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
    开封第一讲书人阅读 49,821评论 1 290
  • 那天,我揣着相机与录音,去河边找鬼。 笑死,一个胖子当着我的面吹牛,可吹牛的内容都是我干的。 我是一名探鬼主播,决...
    沈念sama阅读 38,960评论 3 408
  • 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
    开封第一讲书人阅读 37,719评论 0 266
  • 序言:老挝万荣一对情侣失踪,失踪者是张志新(化名)和其女友刘颖,没想到半个月后,有当地人在树林里发现了一具尸体,经...
    沈念sama阅读 44,186评论 1 303
  • 正文 独居荒郊野岭守林人离奇死亡,尸身上长有42处带血的脓包…… 初始之章·张勋 以下内容为张勋视角 年9月15日...
    茶点故事阅读 36,516评论 2 327
  • 正文 我和宋清朗相恋三年,在试婚纱的时候发现自己被绿了。 大学时的朋友给我发了我未婚夫和他白月光在一起吃饭的照片。...
    茶点故事阅读 38,650评论 1 340
  • 序言:一个原本活蹦乱跳的男人离奇死亡,死状恐怖,灵堂内的尸体忽然破棺而出,到底是诈尸还是另有隐情,我是刑警宁泽,带...
    沈念sama阅读 34,329评论 4 330
  • 正文 年R本政府宣布,位于F岛的核电站,受9级特大地震影响,放射性物质发生泄漏。R本人自食恶果不足惜,却给世界环境...
    茶点故事阅读 39,936评论 3 313
  • 文/蒙蒙 一、第九天 我趴在偏房一处隐蔽的房顶上张望。 院中可真热闹,春花似锦、人声如沸。这庄子的主人今日做“春日...
    开封第一讲书人阅读 30,757评论 0 21
  • 文/苍兰香墨 我抬头看了看天上的太阳。三九已至,却和暖如春,着一层夹袄步出监牢的瞬间,已是汗流浃背。 一阵脚步声响...
    开封第一讲书人阅读 31,991评论 1 266
  • 我被黑心中介骗来泰国打工, 没想到刚下飞机就差点儿被人妖公主榨干…… 1. 我叫王不留,地道东北人。 一个月前我还...
    沈念sama阅读 46,370评论 2 360
  • 正文 我出身青楼,却偏偏与公主长得像,于是被迫代替她去往敌国和亲。 传闻我的和亲对象是个残疾皇子,可洞房花烛夜当晚...
    茶点故事阅读 43,527评论 2 349

推荐阅读更多精彩内容