Disruptor相对于传统ConcurrentQueue 速度对比分析

frahahaha

于 2019-07-18 14:42:17 发布

阅读量840

点赞数

CC 4.0 BY-SA版权

分类专栏： linux 算法文章标签： java

本文链接：https://blog.youkuaiyun.com/m0_37288350/article/details/96430220

这篇博客对比了Disruptor、ConcurrentQueue和BlockingQueue在不同数据规模下的入队响应时间。结果显示，Disruptor在大多数情况下展现出显著优于ConcurrentQueue和BlockingQueue的性能，尤其是在大数据量处理时。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

入队响应时间对比

public static void main(String[] args) throws InterruptedException {
        Disruptor<Event> dp = new Disruptor<>(Event::new, 33554432, Thread::new);
        final RingBuffer<Event> bf = dp.getRingBuffer();
        Thread th = new Thread(() -> {
            int i = 0;
            long start = System.currentTimeMillis();
            for (; i < 100000; i++) {
                long seq = bf.next();
                Event e = dp.get(seq);
                e.setMessage("message " + i++);
                bf.publish(seq);
            }
            long use = System.currentTimeMillis() - start;
            System.out.println("using time: " + use);
        });
        dp.start();
        th.start();
        th.join();
        Queue<Event> queue = new ConcurrentLinkedQueue<>();
        Thread th1 = new Thread(() -> {
            int i = 0;
            long start = System.currentTimeMillis();
            for (; i &l