使用countDownLatch 模拟高并发场景

package com.company;

import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;


public class Main {
    static volatile ArrayList list7 = new ArrayList<String>();

    public static void main(String[] args) throws InterruptedException {
        ExecutorService service = Executors.newFixedThreadPool(8);
        int count = 5;
        final CountDownLatch countDownLatch = new CountDownLatch(count+1);
        final List list = list7;
        for(int i=0;i<count;++i) {
            final  int j = i;
            service.submit(
                    ()->{
                        countDownLatch.countDown();
                        try {
                            countDownLatch.await();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                        //System.out.println("准备了");
                        list.add(j);
                        System.out.println("结束"+list);
                    }
            );
        }
        countDownLatch.countDown();
        countDownLatch.await();
        System.out.println("开始比赛");
        service.shutdown();
        System.out.println("线程运行结束");
        System.out.println(list);
    }



}

使用 syclicBarrier 来实现

package com.company;

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


public class Main {
    static volatile ArrayList list7 = new ArrayList<String>();
    final static Object lock = new Object();


    public static void main(String[] args) throws InterruptedException {
        ExecutorService service = Executors.newFixedThreadPool(8);
        int count = 5;
        final CyclicBarrier cyclicBarrier = new CyclicBarrier(count);
        final List list = list7;
        for(int i=0;i<count;++i) {
            final  int j = i;
            service.submit(
                    ()->{

                        try {
                            cyclicBarrier.await();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        } catch (BrokenBarrierException e) {
                            e.printStackTrace();
                        }
                        //System.out.println("准备了");
                        synchronized (lock) {
                            list.add(j);
                            System.out.println("结束"+list);
                        }
                    }
            );
        }

        System.out.println("开始比赛");
        Thread.sleep(4*1000);
        service.shutdown();
        System.out.println("线程运行结束");
        System.out.println(list);
    }



}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值