如何模拟真正的高并发请求(countdownlatch和cyclicbarrier)

代码参考importNew上面的实例,做了优化,更便于理解
说明:CountDownLatch和CyclicBarrier底层都是通过计数器实现的
实例1,使用CountDownLatch模拟高并发
场景化:有一道阻塞墙,站着一个管理员,手里拿着N(线程数)个牌子,到达一个线程,把牌子给该线程,当手里牌子都发完时,打开墙门,放行所有线程通过

package com.xicheng.concurrent;

import java.util.concurrent.CountDownLatch;

/**
 * @author xichengxml
 * @date 2019/1/25 15:02
 * 该类用于模拟高并发请求,参考文档
 * @see <a href="http://www.importnew.com/30073.html"></a>
 */
public class MockMultiThreadController {
    private static final int NUM = 5;
    private static int count = 0;

    public static void main(String[] args) {
        CountDownLatch countDownLatch = new CountDownLatch(NUM);
        System.out.println("Ready, Go!");
        waitAllArrrived(countDownLatch);
        try {
            // 阻塞等待
            countDownLatch.await();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        System.out.println("Finished");
    }

    /**
     * @return
     * 任务启动,到达一个计数减1,都到达后开启gate
     */
    private static void waitAllArrrived(CountDownLatch countDownLatch) {
        for (int i = 0; i < NUM; i++) {
            Thread t = new Thread() {
                @Override
                public void run() {
                    try {
                        bizCode();
                    } catch (Exception e) {
                        e.printStackTrace();
                    } finally {
                        countDownLatch.countDown();
                    }
                }
            };
            t.start();
        }
    }

    /**
     * 业务调用,对数字进行加1操作
     */
    private static void bizCode() {
        for (int i = 0; i < 10; i++) {
            count++;
            System.out.println("This is bizCode--" + i + "count:" + count);
            try {
                Thread.sleep(100);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
    }
}

实例2:使用CyclicBarrier模拟高并发
场景化:有一道阻塞墙,墙上有个门,门上有N(线程数)把锁,每个线程持有一把钥匙,到达之后就打开自己的锁,全部锁打开后,门开启放行所有线程

package com.xicheng.concurrent;

import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;

/**
 * @author xichengxml
 * @date 2019/1/25 17:00
 * 使用cyclicbarrier模拟高并发请求
 */
public class MockMultiThreadController02 {

    private static final int NUM = 5;
    private static int count = 0;

    public static void main(String[] args) {
        Thread finishThread = new Thread(){
            @Override
            public void run() {
                System.out.println("Finished");
            }
        };
        System.out.println("Ready, Go!");
        CyclicBarrier cyclicBarrier = new CyclicBarrier(NUM, finishThread);
        waitAllArrrived(cyclicBarrier);
    }

    public static void waitAllArrrived(CyclicBarrier cyclicBarrier) {
        for (int i = 0; i < NUM; i++) {
            Thread t = new Thread() {
                @Override
                public void run() {
                    bizCode();
                    try {
                        cyclicBarrier.await();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    } catch (BrokenBarrierException e) {
                        e.printStackTrace();
                    }
                }
            };
            t.start();
        }
    }

    /**
     * 业务调用,对数字进行加1操作
     */
    private static void bizCode() {
        for (int i = 0; i < 10; i++) {
            count++;
            System.out.println("This is bizCode--" + i + "count:" + count);
            try {
                Thread.sleep(100);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
    }
}

评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值