前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >ConcurrentLinkedQueue vs BlockingQueue比较

ConcurrentLinkedQueue vs BlockingQueue比较

作者头像
用户3579639
发布2019-10-22 14:48:45
4560
发布2019-10-22 14:48:45
举报

纯demo代码

代码语言:javascript
复制
package com.honey;

import java.util.Arrays;
import java.util.List;
import java.util.concurrent.*;

public class ConsumerQueueDemo {

    public static void main(String[] args) {
        //making hot spot code
//        for (int i = 0; i < 100; i++) {
//            blockingVersion(false);
//            lockFreeVersion(false);
//        }
        System.err.println("///=============///");
        blockingVersion(true);
        lockFreeVersion(true);
    }

    private static void blockingVersion(boolean print) {
        List<Integer> array = g();
        BlockingQueue blockingQueue = new ArrayBlockingQueue(array.size(), false, array);
        long startMills = System.currentTimeMillis();
        int threadNum = 10;
        CountDownLatch countDownLatch = new CountDownLatch(threadNum);
        ExecutorService pool = Executors.newFixedThreadPool(threadNum);
        for (int i = 0; i < threadNum; i++) {
            pool.execute(new BlockingConsumer(blockingQueue, countDownLatch));
        }
        pool.shutdown();
        try {
            countDownLatch.await();
        } catch (InterruptedException e) {
            //
        }
        if (print)
        System.out.println("blocking version cost ms:" + (System.currentTimeMillis() - startMills));

    }

    private static void lockFreeVersion(boolean print) {
        List<Integer> array = g();
        ConcurrentLinkedQueue linkedQueue = new ConcurrentLinkedQueue(Arrays.asList(array));
        long startMills = System.currentTimeMillis();
        int threadNum = 10;
        CountDownLatch countDownLatch = new CountDownLatch(threadNum);
        ExecutorService pool = Executors.newFixedThreadPool(threadNum);
        for (int i = 0; i < threadNum; i++) {
            pool.execute(new LockFreeConsumer(linkedQueue, countDownLatch));
        }
        pool.shutdown();
        try {
            countDownLatch.await();
        } catch (InterruptedException e) {
            //
        }
        if (print)
        System.out.println("lock free cost ms:" + (System.currentTimeMillis() - startMills));

    }

    static class BlockingConsumer implements Runnable {
        final BlockingQueue blockingQueue;
        final CountDownLatch countDownLatch;
        BlockingConsumer(BlockingQueue blockingQueue, CountDownLatch countDownLatch) {
            this.blockingQueue = blockingQueue;
            this.countDownLatch = countDownLatch;
        }
        @Override
        public void run() {
            try {
                for (; ; ) {
                    Object object = blockingQueue.poll();
                    if (object == null) {
                        return;
                    }
                    //doing works
                    Thread.sleep(20L);
                }
            } catch (InterruptedException e) {
                //
            } finally {
                countDownLatch.countDown();
            }

        }
    }

    static class LockFreeConsumer implements Runnable {
        final ConcurrentLinkedQueue linkedQueue;
        final CountDownLatch countDownLatch;
        LockFreeConsumer(ConcurrentLinkedQueue linkedQueue, CountDownLatch countDownLatch) {
            this.linkedQueue = linkedQueue;
            this.countDownLatch = countDownLatch;
        }
        @Override
        public void run() {
            try {
                for (; ; ) {
                    Object object = linkedQueue.poll();
                    if (object == null) {
                        return;
                    }
                    //doing works
                    Thread.sleep(20L);
                }
            } catch (InterruptedException e) {
                //
            } finally {
                countDownLatch.countDown();
            }

        }
    }

    static List<Integer> g() {
        Integer[] array = new Integer[10_000];
        Arrays.fill(array, 0);
        return Arrays.asList(array);
    }
}

结果 /// /// /// ///=============/// blocking version cost ms:22052 lock free cost ms:22

本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
相关产品与服务
对象存储
对象存储(Cloud Object Storage,COS)是由腾讯云推出的无目录层次结构、无数据格式限制,可容纳海量数据且支持 HTTP/HTTPS 协议访问的分布式存储服务。腾讯云 COS 的存储桶空间无容量上限,无需分区管理,适用于 CDN 数据分发、数据万象处理或大数据计算与分析的数据湖等多种场景。
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档