Fork/Join框架是一个把大任务分割成若干个小任务,最终汇总每个小任务结果后得到大任务结果的框架
public class CountTask extends RecursiveTask<Integer> {
private static final int THRESHOLD = 2;
private int start;
private int end;
public CountTask(int start, int end) {
this.start = start;
this.end = end;
}
@Override
protected Integer compute() {
int sum = 0;
//任务如果比较小,就直接计算了
boolean canCompute = (end - start) <= THRESHOLD;
if (canCompute) {
for (int i = start; i <= end; i++) {
sum += i;
}
} else {
//分成两个子任务
int middle = (start + end) / 2;
CountTask leftTask = new CountTask(start, middle);
CountTask endTask = new CountTask(middle + 1, end);
//执行子任务
leftTask.fork();
endTask.fork();
//等待子任务执行完毕,并将结果汇总
int leftTaskResult = leftTask.join();
int rightTaskResult = endTask.join();
sum = leftTaskResult + rightTaskResult;
}
return sum;
}
public static void main(String[] args) throws ExecutionException, InterruptedException {
ForkJoinPool forkJoinPool = new ForkJoinPool();
CountTask task = new CountTask(1, 4);
Future<Integer> result = forkJoinPool.submit(task);
System.out.println(result.get());
}
}
ForkJoinTask与一般的任务区别在于实现compute(), 这个方法中,首先判断任务是否足够小,如果足够小就直接执行任务,否则就分割成两个自任务,每个子任务在调用fork()时,又会进入compute()。使用join()会等待任务执行完并得到其结果。