线程同步工具类--CyclicBarrier

CyclicBarrier

表示大家彼此等待,等大家集合好后才开始出发,分散活动后又在指定地点集合碰面

package com.javase.thread;

import java.util.Random;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.ReentrantLock;
/**
 * 
 * @author Alex Zhuang
 *
 */
public class CyclicBarrierDemo {
	private static boolean isPrint1=true;
	private static boolean isPrint2=true;
	private static ReentrantLock lock = new ReentrantLock();
	public static void main(String[] args) {
		final CyclicBarrier barrier = new CyclicBarrier(3);
		ExecutorService threadPool = Executors.newCachedThreadPool();
		for(int i=0;i<3;i++){
			Runnable command =new Runnable(){
				public void run() {
					System.out.println(Thread.currentThread().getName()+" is waiting now");
					try {
						TimeUnit.MILLISECONDS.sleep(new Random().nextInt(5000));
					} catch (InterruptedException e1) {
						e1.printStackTrace();
					}
					System.out.println("the number of threads currently waiting at the barrier 1 is : "+barrier.getNumberWaiting());
					try {
						barrier.await();
					} catch (InterruptedException e) {
						e.printStackTrace();
					} catch (BrokenBarrierException e) {
						e.printStackTrace();
					}
					lock.lock();
					try{
						if(isPrint1){
							System.out.println("All the 3 threads have arrived at place 1");
							isPrint1=false;
						}
					}finally{
						lock.unlock();
					}
					
					System.out.println(Thread.currentThread().getName()+" is waiting now");
					try {
						TimeUnit.MILLISECONDS.sleep(new Random().nextInt(5000));
					} catch (InterruptedException e1) {
						e1.printStackTrace();
					}
					System.out.println("the number of threads currently waiting at the barrier 2 is : "+barrier.getNumberWaiting());
					try {
						barrier.await();
					} catch (InterruptedException e) {
						e.printStackTrace();
					} catch (BrokenBarrierException e) {
						e.printStackTrace();
					}
					lock.lock();
					try{
						if(isPrint2){
							System.out.println("All the 3 threads have arrived at place 2");
							isPrint2=false;
						}
					}finally{
						lock.unlock();
					}
					
					
					
				}
			};
			threadPool.execute(command);
		}
		threadPool.shutdown();

	}

}


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值