CyclicBarrier的介绍及使用

作用

让一组线程达到某个屏障，被阻塞，一直到组内最后一个线程达到屏障时，屏障开放，所有被阻塞的线程会继续运行CyclicBarrier(int parties)

构造方法

CyclicBarrier( int parties )，默认屏障开放时所有线程同时执行；
CyclicBarrier( int parties, Runnable barrierAction )，屏障开放，barrierAction定义的任务会执行，执行完成后之前的线程就会接着执行

CountDownLatch和CyclicBarrier辨析

1. countdownlatch放行由第三者控制，CyclicBarrier放行由一组线程本身控制
2. countdownlatch放行条件>=线程数，CyclicBarrier放行条件=线程数

public class UseCyclicBarrier {
	
	//创建CyclicBarrier对象，并指定一个线程等待屏幕开放后执行
	private static CyclicBarrier barrier 
		= new CyclicBarrier(5, new CollectThread());
	
    private static ConcurrentHashMap<String,Long> resultMap
            = new ConcurrentHashMap<>();//存放子线程工作结果的容器

    public static void main(String[] args) {
        for(int i=0;i<=4;i++){
            Thread thread = new Thread(new SubThread());
            thread.start();
        }

    }

    //负责屏障开放以后的工作，等待其他线程执行完
    private static class CollectThread implements Runnable{

        @Override
        public void run() {
            StringBuilder result = new StringBuilder();
            for(Map.Entry<String,Long> workResult:resultMap.entrySet()){
            	result.append("["+workResult.getValue()+"]");
            }
            System.out.println(" the result = "+ result);
            System.out.println("do other business........");
        }
    }

    //工作线程
    private static class SubThread implements Runnable{

        @Override
        public void run() {
        	long id = Thread.currentThread().getId();//线程本身的处理结果
            resultMap.put(Thread.currentThread().getId()+"",id);
            Random r = new Random();//随机决定工作线程的是否睡眠
            try {
                if(r.nextBoolean()) {
                	Thread.sleep(2000+id);
                	System.out.println("Thread_"+id+" ....do something ");
                }
                System.out.println(id+"....is await");
                barrier.await();
            	Thread.sleep(1000+id);
                System.out.println("Thread_"+id+" ....do its business ");
            } catch (Exception e) {
                e.printStackTrace();
            }

        }
    }
}