线程池和直接创建线程的简单性能对比

转自https://blog.csdn.net/u014104286/article/details/71775038

都说线程池的性能比直接创建线程(新学了一个词,叫野线程😂)性能要高,简单的做了个实验,未必准确仅供参考,先上结论

实验平台mac系统,8代i7处理器,16G内存,十万次创建线程,差距是50倍以上。

 

通过线程池创建:

package concurrent.performanceTestWithOriginThread;

import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class OneHundredThousandWithThreadPool {

  private ConcurrentLinkedQueue<String> queue = new ConcurrentLinkedQueue<String>();
  //	private ArrayList<String> queue = new ArrayList<String>();
//	private CyclicBarrier barrier = new CyclicBarrier(10000000);
  private CountDownLatch latch = new CountDownLatch(100000);
  ExecutorService excutor = Executors.newFixedThreadPool(4);

  public static void main(String[] args) {
    OneHundredThousandWithThreadPool test001 = new OneHundredThousandWithThreadPool();
    long timeStart = System.currentTimeMillis();
    test001.start();
    System.out.println(System.currentTimeMillis() - timeStart);
  }

  public void start() {
    for (int i = 0; i < 100000; i++) {
      Runnable001 runnable001 = this.new Runnable001(i);
      excutor.submit(runnable001);
//			new Thread(runnable001).start();
    }
    excutor.shutdown();
    try {
      //等待latch计数为0
      latch.await();
    } catch (Exception e) {
      e.printStackTrace();
    }
    System.out.println(queue.size());
  }

  private class Runnable001 implements Runnable {
    private int value;

    public Runnable001(int value) {
      this.value = value;
    }

    @Override
    public void run() {
      try {
//				barrier.await();
      } catch (Exception e) {
        e.printStackTrace();
      }
      queue.offer(value + "");
      latch.countDown();//latch计数减一
    }

  }
}

通过野线程创建:

package concurrent.performanceTestWithOriginThread;

import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.CountDownLatch;

public class OneHundredThousandWithThread
{
  private ConcurrentLinkedQueue<String> queue = new ConcurrentLinkedQueue<String>();
  //	private ArrayList<String> queue = new ArrayList<String>();
//	private CyclicBarrier barrier = new CyclicBarrier(10000000);
  private CountDownLatch latch = new CountDownLatch(100000);

  public static void main(String[] args) {
    OneHundredThousandWithThread test001 = new OneHundredThousandWithThread();
    long timeStart = System.currentTimeMillis();
    test001.start();
    System.out.println(System.currentTimeMillis() - timeStart);
  }

  public void start() {
    for (int i = 0; i < 100000; i++) {
      OneHundredThousandWithThread.Runnable001 runnable001 = this.new Runnable001(i);
//      excutor.submit(runnable001);
			new Thread(runnable001).start();
    }
    try {
      //等待latch计数为0
      latch.await();
    } catch (Exception e) {
      e.printStackTrace();
    }
    System.out.println(queue.size());
  }

  private class Runnable001 implements Runnable {
    private int value;

    public Runnable001(int value) {
      this.value = value;
    }

    @Override
    public void run() {
      try {
//				barrier.await();
      } catch (Exception e) {
        e.printStackTrace();
      }
      queue.offer(value + "");
      latch.countDown();//latch计数减一
    }
  }
}

 

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值