测试ConcurrentHashMap

最新推荐文章于 2024-08-19 11:28:55 发布

原创最新推荐文章于 2024-08-19 11:28:55 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

多线程与高并发专栏收录该内容

68 篇文章

订阅专栏

该博客通过并发测试展示了ConcurrentHashMap在多线程环境下的性能。首先创建了一个ConcurrentHashMap，并用多个线程进行并发插入操作，然后测量了插入操作的时间。接着，再次使用多个线程进行大量并发读取操作，同样记录了执行时间。测试结果显示ConcurrentHashMap在高并发场景下表现出良好的性能和效率。

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

												测试ConcurrentHashMap

package src.main.java.com.qqjx.thread;

import java.util.Map;
import java.util.UUID;
import java.util.concurrent.ConcurrentHashMap;

public class T04_TestConcurrentHashMap {

    static Map<UUID, UUID> m = new ConcurrentHashMap<>();

    static int count = Constants.COUNT;
    static UUID[] keys = new UUID[count];
    static UUID[] values = new UUID[count];
    static final int THREAD_COUNT = Constants.THREAD_COUNT;

    static {
        for (int i = 0; i < count; i++) {
            keys[i] = UUID.randomUUID();
            values[i] = UUID.randomUUID();
        }
    }

    static class MyThread extends Thread {
        int start;
        int gap = count/THREAD_COUNT;

        public MyThread(int start) {
            this.start = start;
        }

        @Override
        public void run() {
            for(int i=start; i<start+gap; i++) {
                m.put(keys[i], values[i]);
            }
        }
    }

    public static void main(String[] args) {

        long start = System.currentTimeMillis();

        Thread[] threads = new Thread[THREAD_COUNT];

        for(int i=0; i<threads.length; i++) {
            threads[i] =
                    new MyThread(i * (count/THREAD_COUNT));
        }

        for(Thread t : threads) {
            t.start();
        }

        for(Thread t : threads) {
            try {
                t.join();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

        long end = System.currentTimeMillis();
        System.out.println(end - start);

        System.out.println(m.size());

        //-----------------------------------

        start = System.currentTimeMillis();
        for (int i = 0; i < threads.length; i++) {
            threads[i] = new Thread(()->{
                for (int j = 0; j < 10000000; j++) {
                    m.get(keys[10]);
                }
            });
        }

        for(Thread t : threads) {
            t.start();
        }

        for(Thread t : threads) {
            try {
                t.join();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

        end = System.currentTimeMillis();
        System.out.println(end - start);
    }
}

533
1000000
671