我的测试CyclicBarrier的代码

package cyclicBarrier;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

public class Main {

	public static void main(String[] args) {
		Project project = new Project(
			new int[][]{
				{1,2,3},
				{3,2,1},
				{4,3,1},
			}
		);
		project.beginProject();
	}

}

// 一个简单的工作,完成工作需要workDay的时间
class Work {
	private int workDay;
	public Work(int workDay) {
		this.workDay = workDay;
	}
	public void doWork() throws InterruptedException {
		Thread.sleep(workDay*1000);
	}
}

// 一个工作流水线,需要按顺序完成每个工作
class OneLineWorkGroup {
	private LinkedList<Work> workList = new LinkedList<Work>();
	public OneLineWorkGroup(int[] workDayList) {
		for (int n : workDayList)
			workList.add(new Work(n));
	}
	public void startWorkByIndex(int n) throws InterruptedException {
		if (n<0 || n>=workList.size())
			throw new IllegalArgumentException("work index lager than the max index");
		workList.get(n).doWork();
	}
	public int getWorkListSize() {
		return workList.size();
	}
}

// 一个项目,由几条工作流水线组成。
// 流水线之间是可以并发的。但每个流水线第n项工作,必须在所有流水线的第n-1项工作完成之后,才能开始。
class Project {
	private OneLineWorkGroup[] syncWorkGroups;
	public Project(int[][] workDays) {
		final int groupCount = workDays.length;
		syncWorkGroups = new OneLineWorkGroup[groupCount];
		for (int n=0; n<groupCount; ++n) {
			int[] oneLineDays = workDays[n];
			syncWorkGroups[n] = new OneLineWorkGroup(oneLineDays);
		}
	}
	public void beginProject() {
		int workCount = syncWorkGroups.length;
		final CyclicBarrier cyclicBarrier = new CyclicBarrier(workCount);
		ExecutorService exe = Executors.newFixedThreadPool(workCount);
		List<Future<?>> futureList = new ArrayList<Future<?>>(workCount);
		for (int n=0; n<workCount; ++n) {
			final int groupIndex = n;
			Future<?> future = exe.submit(new Runnable() {
				@Override
				public void run() {
					OneLineWorkGroup oneLineWorkGroup = syncWorkGroups[groupIndex];
					int workListSize = oneLineWorkGroup.getWorkListSize();
					for (int workIndex=0; workIndex<workListSize; ++workIndex) {
						try {
							oneLineWorkGroup.startWorkByIndex(workIndex);
							System.out.println(String.format("finished: groupIndex==%d, workIndex==%d", groupIndex, workIndex));
							cyclicBarrier.await();
						} catch (InterruptedException e) {
							e.printStackTrace();
						} catch (BrokenBarrierException e) {
							e.printStackTrace();
						}
					}
				}
			});
			futureList.add(future);
		}
		for (Future<?> future : futureList) {
			Object object;
			try {
				object = future.get();
				System.out.println(object);
			} catch (InterruptedException e) {
				e.printStackTrace();
			} catch (ExecutionException e) {
				e.printStackTrace();
			}
		}
		exe.shutdown();
	}
}








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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值